Streaming engine with compressed encoding for loop circular buffer sizes

ABSTRACT

A streaming engine employed in a digital data processor specifies a fixed read only data stream defined by plural nested loops. An address generator produces address of data elements for the nested loops. A steam head register stores data elements next to be supplied to functional units for use as operands. A stream template register specifies a circular address mode for the loop, first and second block size numbers and a circular address block size selection. For a first circular address block size selection the block size corresponds to the first block size number. For a first circular address block size selection the block size corresponds to the first block size number. For a second circular address block size selection the block size corresponds to a sum of the first block size number and the second block size number.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/423,813 filed on May 28, 2019, which is a continuation of U.S. patentapplication Ser. No. 15/971,875 filed on May 4, 2018, now U.S. Pat. No.10,303,611, which is a continuation of U.S. patent application Ser. No.15/384,514 filed on Dec. 20, 2016, now U.S. Pat. No. 9,965,278, each ofwhich is incorporated by reference herein in its entirety.

This application is an improvement over U.S. patent application Ser. No.14/331,986 filed Jul. 15, 2014, entitled HIGHLY INTEGRATED SCALABLE,FLEXIBLE DSP MEGAMODULE ARCHITECTURE, which claims priority from U.S.Provisional Patent Application Ser. No. 61/846,148 filed Jul. 15, 2013.

TECHNICAL FIELD

The technical field of this disclosure is digital data processing and,more specifically, techniques for control of a streaming engine used foroperand fetching.

BACKGROUND

Modern digital signal processors (DSP) faces multiple challenges.Workloads continue to increase, requiring increasing bandwidth. Systemson a chip (SOC) continue to grow in size and complexity. Memory systemlatency severely impacts certain classes of algorithms. As transistorsget smaller, memories and registers become less reliable. As softwarestacks get larger, the number of potential interactions and errorsbecomes larger.

Memory bandwidth and scheduling are a problem for digital signalprocessors operating on real-time data. Digital signal processorsoperating on real-time data typically receive an input data stream,perform a filter function on the data stream (such as encoding ordecoding) and output a transformed data stream. The system is calledreal-time because the application fails if the transformed data streamis not available for output when scheduled. Typical video encodingrequires a predictable but non-sequential input data pattern. Often thecorresponding memory accesses are difficult to achieve within availableaddress generation and memory access resources. A typical applicationrequires memory access to load data registers in a data register fileand then supply to functional units which perform the data processing.

BRIEF SUMMARY

This disclosure relates to a streaming engine employed in a digitalsignal processor. A fixed data stream sequence is specified by storingcorresponding parameters in a control register. The data stream includesplural nested loops. Once started the data stream is read only andcannot be written. A functional unit using the stream data has a firstinstruction type that only reads the data and a second instruction typeboth reads the data and causes the streaming engine to advance thestream. This generally corresponds to the needs of a real-time filteringoperation.

The streaming engine includes an address generator which producesaddress of data elements and a steam head register which stores dataelements next to be supplied to functional units for use as operands.The address generator has at least one loop having a circular addressingmode with a selectable circular block size.

A stream template register specifies a circular address mode for theloop, first and second block size numbers and a circular address blocksize selection. For a first circular address block size selection theblock size corresponds to the first block size number. For a firstcircular address block size selection the block size corresponds to thefirst block size number. For a second circular address block sizeselection the block size corresponds to a sum of the first block sizenumber and the second block size number.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects of this invention are illustrated in thedrawings, in which:

FIG. 1 illustrates a dual scalar/vector datapath processor according toone embodiment of this invention;

FIG. 2 illustrates the registers and functional units in the dualscalar/vector datapath processor illustrated in FIG. 1;

FIG. 3 illustrates a global scalar register file;

FIG. 4 illustrates a local scalar register file shared by arithmeticfunctional units;

FIG. 5 illustrates a local scalar register file shared by multiplyfunctional units;

FIG. 6 illustrates a local scalar register file shared by load/storeunits;

FIG. 7 illustrates a global vector register file;

FIG. 8 illustrates a predicate register file;

FIG. 9 illustrates a local vector register file shared by arithmeticfunctional units;

FIG. 10 illustrates a local vector register file shared by multiply andcorrelation functional units;

FIG. 11 illustrates pipeline phases of a central processing unitaccording to a preferred embodiment of this invention;

FIG. 12 illustrates sixteen instructions of a single fetch packet;

FIG. 13 illustrates an example of the instruction coding of instructionsused by this invention;

FIG. 14 illustrates the bit coding of a condition code extension slot 0;

FIG. 15 illustrates the bit coding of a condition code extension slot 1;

FIG. 16 illustrates the bit coding of a constant extension slot 0;

FIG. 17 is a partial block diagram illustrating constant extension;

FIG. 18 illustrates the carry control for SIMD operations according tothis invention;

FIG. 19 illustrates a conceptual view of the streaming engines of thisinvention;

FIG. 20 illustrates a first example of lane allocation in a vector;

FIG. 21 illustrates a second example of lane allocation in a vector;

FIG. 22 illustrates a basic two dimensional stream;

FIG. 23 illustrates the order of elements within the example stream ofFIG. 21;

FIG. 24 illustrates extracting a smaller rectangle from a largerrectangle;

FIG. 25 illustrates how the streaming engine would fetch the stream ofthis example with a transposition granularity of 4 bytes;

FIG. 26 illustrates how the streaming engine would fetch the stream ofthis example with a transposition granularity of 8 bytes;

FIG. 27 illustrates the details of streaming engine of this invention;

FIG. 28 illustrates a stream template register of this invention;

FIG. 29 illustrates sub-field definitions of the flags field of thestream template register of this invention;

FIG. 30 illustrates a first alternate stream template register of thisinvention as specified by a dimension format field;

FIG. 31 illustrates a second alternate stream template register of thisinvention as specified by a dimension format field;

FIG. 32 illustrates a third alternate stream template register of thisinvention as specified by a dimension format field;

FIG. 33 illustrates a fourth alternate stream template register of thisinvention as specified by a dimension format field;

FIG. 34 illustrates a fifth alternate stream template register of thisinvention as specified by a dimension format field;

FIG. 35 illustrates a loop count selection circuit for selecting streamdefinition template bits for loop count for the plural nested loops ascontrolled by the dimensional format field;

FIG. 36 illustrates a loop dimension selection circuit for selectingstream definition template bits for loop dimension for the plural nestedloops as controlled by the dimensional format field;

FIG. 37 illustrates an example of adder control word circuit whichgenerates an adder control word for loop address generators controllingthe selection of linear address mode and circular address mode;

FIG. 38 is a partial schematic diagram illustrating address generationfor the nested loops of this invention;

FIG. 39 illustrates a partial schematic diagram showing the streamingengine supply of operands of this invention.

DETAILED DESCRIPTION

FIG. 1 illustrates a dual scalar/vector datapath processor according toa preferred embodiment of this invention. Processor 100 includesseparate level one instruction cache (L1I) 121 and level one data cache(L1D) 123. Processor 100 includes a level two combined instruction/datacache (L2) 130 that holds both instructions and data. FIG. 1 illustratesconnection between level one instruction cache 121 and level twocombined instruction/data cache 130 (bus 142). FIG. 1 illustratesconnection between level one data cache 123 and level two combinedinstruction/data cache 130 (bus 145). In the preferred embodiment ofprocessor 100 level two combined instruction/data cache 130 stores bothinstructions to back up level one instruction cache 121 and data to backup level one data cache 123. In the preferred embodiment level twocombined instruction/data cache 130 is further connected to higher levelcache and/or main memory in a manner not illustrated in FIG. 1. In thepreferred embodiment central processing unit core 110, level oneinstruction cache 121, level one data cache 123 and level two combinedinstruction/data cache 130 are formed on a single integrated circuit.This signal integrated circuit optionally includes other circuits.

Central processing unit core 110 fetches instructions from level oneinstruction cache 121 as controlled by instruction fetch unit 111.Instruction fetch unit 111 determines the next instructions to beexecuted and recalls a fetch packet sized set of such instructions. Thenature and size of fetch packets are further detailed below. As known inthe art, instructions are directly fetched from level one instructioncache 121 upon a cache hit (if these instructions are stored in levelone instruction cache 121). Upon a cache miss (the specified instructionfetch packet is not stored in level one instruction cache 121), theseinstructions are sought in level two combined cache 130. In thepreferred embodiment the size of a cache line in level one instructioncache 121 equals the size of a fetch packet. The memory locations ofthese instructions are either a hit in level two combined cache 130 or amiss. A hit is serviced from level two combined cache 130. A miss isserviced from a higher level of cache (not illustrated) or from mainmemory (not illustrated). As is known in the art, the requestedinstruction may be simultaneously supplied to both level one instructioncache 121 and central processing unit core 110 to speed use.

In the preferred embodiment of this invention, central processing unitcore 110 includes plural functional units to perform instructionspecified data processing tasks. Instruction dispatch unit 112determines the target functional unit of each fetched instruction. Inthe preferred embodiment central processing unit 110 operates as a verylong instruction word (VLIW) processor capable of operating on pluralinstructions in corresponding functional units simultaneously.Preferably a complier organizes instructions in execute packets that areexecuted together. Instruction dispatch unit 112 directs eachinstruction to its target functional unit. The functional unit assignedto an instruction is completely specified by the instruction produced bya compiler. The hardware of central processing unit core 110 has no partin this functional unit assignment. In the preferred embodimentinstruction dispatch unit 112 may operate on plural instructions inparallel. The number of such parallel instructions is set by the size ofthe execute packet. This will be further detailed below.

One part of the dispatch task of instruction dispatch unit 112 isdetermining whether the instruction is to execute on a functional unitin scalar datapath side A 115 or vector datapath side B 116. Aninstruction bit within each instruction called the s bit determineswhich datapath the instruction controls. This will be further detailedbelow.

Instruction decode unit 113 decodes each instruction in a currentexecute packet. Decoding includes identification of the functional unitperforming the instruction, identification of registers used to supplydata for the corresponding data processing operation from among possibleregister files and identification of the register destination of theresults of the corresponding data processing operation. As furtherexplained below, instructions may include a constant field in place ofone register number operand field. The result of this decoding issignals for control of the target functional unit to perform the dataprocessing operation specified by the corresponding instruction on thespecified data.

Central processing unit core 110 includes control registers 114. Controlregisters 114 store information for control of the functional units inscalar datapath side A 115 and vector datapath side B 116 in a mannernot relevant to this invention. This information could be modeinformation or the like.

The decoded instructions from instruction decode 113 and informationstored in control registers 114 are supplied to scalar datapath side A115 and vector datapath side B 116. As a result functional units withinscalar datapath side A 115 and vector datapath side B 116 performinstruction specified data processing operations upon instructionspecified data and store the results in an instruction specified dataregister or registers. Each of scalar datapath side A 115 and vectordatapath side B 116 includes plural functional units that preferablyoperate in parallel. These will be further detailed below in conjunctionwith FIG. 2. There is a datapath 117 between scalar datapath side A 115and vector datapath side B 116 permitting data exchange.

Central processing unit core 110 includes further non-instruction basedmodules. Emulation unit 118 permits determination of the machine stateof central processing unit core 110 in response to instructions. Thiscapability will typically be employed for algorithmic development.Interrupts/exceptions unit 119 enable central processing unit core 110to be responsive to external, asynchronous events (interrupts) and torespond to attempts to perform improper operations (exceptions).

Central processing unit core 110 includes streaming engine 125.Streaming engine 125 supplies two data streams from predeterminedaddresses typically cached in level two combined cache 130 to registerfiles of vector datapath side B. This provides controlled data movementfrom memory (as cached in level two combined cache 130) directly tofunctional unit operand inputs. This is further detailed below.

FIG. 1 illustrates exemplary data widths of busses between variousparts. Level one instruction cache 121 supplies instructions toinstruction fetch unit 111 via bus 141. Bus 141 is preferably a 512-bitbus. Bus 141 is unidirectional from level one instruction cache 121 tocentral processing unit core 110. Level two combined cache 130 suppliesinstructions to level one instruction cache 121 via bus 142. Bus 142 ispreferably a 512-bit bus. Bus 142 is unidirectional from level twocombined cache 130 to level one instruction cache 121.

Level one data cache 123 exchanges data with register files in scalardatapath side A 115 via bus 143. Bus 143 is preferably a 64-bit bus.Level one data cache 123 exchanges data with register files in vectordatapath side B 116 via bus 144. Bus 144 is preferably a 512-bit bus.Busses 143 and 144 are illustrated as bidirectional supporting bothcentral processing unit core 110 data reads and data writes. Level onedata cache 123 exchanges data with level two combined cache 130 via bus145. Bus 145 is preferably a 512-bit bus. Bus 145 is illustrated asbidirectional supporting cache service for both central processing unitcore 110 data reads and data writes.

Level two combined cache 130 supplies data of a first data stream tostreaming engine 125 via bus 146. Bus 146 is preferably a 512-bit bus.Streaming engine 125 supplies data of this first data stream tofunctional units of vector datapath side B 116 via bus 147. Bus 147 ispreferably a 512-bit bus. Level two combined cache 130 supplies data ofa second data stream to streaming engine 125 via bus 148. Bus 148 ispreferably a 512-bit bus. Streaming engine 125 supplies data of thissecond data stream to functional units of vector datapath side B 116 viabus 149. Bus 149 is preferably a 512-bit bus. Busses 146, 147, 148 and149 are illustrated as unidirectional from level two combined cache 130to streaming engine 125 and to vector datapath side B 116 in accordancewith the preferred embodiment of this invention.

In the preferred embodiment of this invention, both level one data cache123 and level two combined cache 130 may be configured as selectedamounts of cache or directly addressable memory in accordance with U.S.Pat. No. 6,606,686 entitled UNIFIED MEMORY SYSTEM ARCHITECTURE INCLUDINGCACHE AND DIRECTLY ADDRESSABLE STATIC RANDOM ACCESS MEMORY.

FIG. 2 illustrates further details of functional units and registerfiles within scalar datapath side A 115 and vector datapath side B 116.Scalar datapath side A 115 includes global scalar register file 211,L1/S1 local register file 212, M1/N1 local register file 213 and D1/D2local register file 214. Scalar datapath side A 115 includes L1 unit221, S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225 and D2 unit 226.Vector datapath side B 116 includes global vector register file 231,L2/S2 local register file 232, M2/N2/C local register file 233 andpredicate register file 234. Vector datapath side B 116 includes L2 unit241, S2 unit 242, M2 unit 243, N2 unit 244, C unit 245 and P unit 246.There are limitations upon which functional units may read from or writeto which register files. These will be detailed below.

Scalar datapath side A 115 includes L1 unit 221. L1 unit 221 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or L1/S1 local register file 212.L1 unit 221 preferably performs the following instruction selectedoperations: 64-bit add/subtract operations; 32-bit min/max operations;8-bit Single Instruction Multiple Data (SIMD) instructions such as sumof absolute value, minimum and maximum determinations; circular min/maxoperations; and various move operations between register files. Theresult may be written into an instruction specified register of globalscalar register file 211, L1/S1 local register file 212, M1/N1 localregister file 213 or D1/D2 local register file 214.

Scalar datapath side A 115 includes S1 unit 222. S1 unit 222 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or L1/S1 local register file 212.S1 unit 222 preferably performs the same type operations as L1 unit 221.There optionally may be slight variations between the data processingoperations supported by L1 unit 221 and S1 unit 222. The result may bewritten into an instruction specified register of global scalar registerfile 211, L1/S1 local register file 212, M1/N1 local register file 213or D1/D2 local register file 214.

Scalar datapath side A 115 includes M1 unit 223. M1 unit 223 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or M1/N1 local register file 213.M1 unit 223 preferably performs the following instruction selectedoperations: 8-bit multiply operations; complex dot product operations;32-bit bit count operations; complex conjugate multiply operations; andbit-wise Logical Operations, moves, adds and subtracts. The result maybe written into an instruction specified register of global scalarregister file 211, L1/S1 local register file 212, M1/N1 local registerfile 213 or D1/D2 local register file 214.

Scalar datapath side A 115 includes N1 unit 224. N1 unit 224 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or M1/N1 local register file 213.N1 unit 224 preferably performs the same type operations as M1 unit 223.There may be certain double operations (called dual issued instructions)that employ both the M1 unit 223 and the N1 unit 224 together. Theresult may be written into an instruction specified register of globalscalar register file 211, L1/S1 local register file 212, M1/N1 localregister file 213 or D1/D2 local register file 214.

Scalar datapath side A 115 includes D1 unit 225 and D2 unit 226. D1 unit225 and D2 unit 226 generally each accept two 64-bit operands and eachproduce one 64-bit result. D1 unit 225 and D2 unit 226 generally performaddress calculations and corresponding load and store operations. D1unit 225 is used for scalar loads and stores of 64 bits. D2 unit 226 isused for vector loads and stores of 512 bits. D1 unit 225 and D2 unit226 preferably also perform: swapping, pack and unpack on the load andstore data; 64-bit SIMD arithmetic operations; and 64-bit bit-wiselogical operations. D1/D2 local register file 214 will generally storebase and offset addresses used in address calculations for thecorresponding loads and stores. The two operands are each recalled froman instruction specified register in either global scalar register file211 or D1/D2 local register file 214. The calculated result may bewritten into an instruction specified register of global scalar registerfile 211, L1/S1 local register file 212, M1/N1 local register file 213or D1/D2 local register file 214.

Vector datapath side B 116 includes L2 unit 241. L2 unit 241 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231, L2/S2 local register file 232 orpredicate register file 234. L2 unit 241 preferably performs instructionsimilar to L1 unit 221 except on wider 512-bit data. The result may bewritten into an instruction specified register of global vector registerfile 231, L2/S2 local register file 232, M2/N2/C local register file 233or predicate register file 234.

Vector datapath side B 116 includes S2 unit 242. S2 unit 242 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231, L2/S2 local register file 232 orpredicate register file 234. S2 unit 242 preferably performsinstructions similar to S1 unit 222 except on wider 512-bit data. Theresult may be written into an instruction specified register of globalvector register file 231, L2/S2 local register file 232, M2/N2/C localregister file 233 or predicate register file 234. There may be certaindouble operations (called dual issued instructions) that employ both L2unit 241 and the S2 unit 242 together. The result may be written into aninstruction specified register of global vector register file 231, L2/S2local register file 232, or M2/N2/C local register file 233.

Vector datapath side B 116 includes M2 unit 243. M2 unit 243 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231 or M2/N2/C local register file233. M2 unit 243 preferably performs instructions similar to M1 unit 223except on wider 512-bit data. The result may be written into aninstruction specified register of global vector register file 231, L2/S2local register file 232, or M2/N2/C local register file 233.

Vector datapath side B 116 includes N2 unit 244. N2 unit 244 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231 or M2/N2/C local register file233. N2 unit 244 preferably performs the same type operations as M2 unit243. There may be certain double operations (called dual issuedinstructions) that employ both M2 unit 243 and the N2 unit 244 together.The result may be written into an instruction specified register ofglobal vector register file 231, L2/S2 local register file 232 orM2/N2/C local register file 233.

Vector datapath side B 116 includes C unit 245. C unit 245 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231 or M2/N2/C local register file233. C unit 245 preferably performs: “Rake” and “Search” instructions;up to 512 2-bit PN*8-bit multiplies I/Q complex multiplies per clockcycle; 8-bit and 16-bit Sum-of-Absolute-Difference (SAD) calculations,up to 512 SADs per clock cycle; horizontal add and horizontal min/maxinstructions; and vector permutes instructions. C unit 245 includes alsocontains 4 vector control registers (CUCR0 to CUCR3) used to controlcertain operations of C unit 245 instructions. Control registers CUCR0to CUCR3 are used as operands in certain C unit 245 operations. Controlregisters CUCR0 to CUCR3 are preferably used: in control of a generalpermutation instruction (VPERM); and as masks for SIMD multiple DOTproduct operations (DOTPM) and SIMD multiple Sum-of-Absolute-Difference(SAD) operations. Control register CUCR0 is preferably used to store thepolynomials for Galois Field Multiply operations (GFMPY). Controlregister CUCR1 is preferably used to store the Galois field polynomialgenerator function.

Vector datapath side B 116 includes P unit 246. P unit 246 performsbasic logic operations on registers of local predicate register file234. P unit 246 has direct access to read from and write to predicationregister file 234. These operations include AND, ANDN, OR, XOR, NOR,BITR, NEG, SET, BITCNT, RMBD, BIT Decimate and Expand. A commonlyexpected use of P unit 246 includes manipulation of the SIMD vectorcomparison results for use in control of a further SIMD vectoroperation.

FIG. 3 illustrates global scalar register file 211. There are 16independent 64-bit wide scalar registers designated AO to A15. Eachregister of global scalar register file 211 can be read from or writtento as 64-bits of scalar data. All scalar datapath side A 115 functionalunits (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225and D2 unit 226) can read or write to global scalar register file 211.Global scalar register file 211 may be read as 32-bits or as 64-bits andmay only be written to as 64-bits. The instruction executing determinesthe read data size. Vector datapath side B 116 functional units (L2 unit241, S2 unit 242, M2 unit 243, N2 unit 244, C unit 245 and P unit 246)can read from global scalar register file 211 via crosspath 117 underrestrictions that will be detailed below.

FIG. 4 illustrates D1/D2 local register file 214. There are 16independent 64-bit wide scalar registers designated D0 to D16. Eachregister of D1/D2 local register file 214 can be read from or written toas 64-bits of scalar data. All scalar datapath side A 115 functionalunits (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225and D2 unit 226) can write to global scalar register file 211. Only D1unit 225 and D2 unit 226 can read from D1/D2 local scalar register file214. It is expected that data stored in D1/D2 local scalar register file214 will include base addresses and offset addresses used in addresscalculation.

FIG. 5 illustrates L1/S1 local register file 212. The embodimentillustrated in FIG. 5 has 8 independent 64-bit wide scalar registersdesignated AL0 to AL7. The preferred instruction coding (see FIG. 13)permits L1/S1 local register file 212 to include up to 16 registers. Theembodiment of FIG. 5 implements only 8 registers to reduce circuit sizeand complexity. Each register of L1/S1 local register file 212 can beread from or written to as 64-bits of scalar data. All scalar datapathside A 115 functional units (L1 unit 221, S1 unit 222, M1 unit 223, N1unit 224, D1 unit 225 and D2 unit 226) can write to L1/S1 local scalarregister file 212. Only L1 unit 221 and S1 unit 222 can read from L1/S1local scalar register file 212.

FIG. 6 illustrates M1/N1 local register file 213. The embodimentillustrated in FIG. 6 has 8 independent 64-bit wide scalar registersdesignated AM0 to AM7. The preferred instruction coding (see FIG. 13)permits M1/N1 local register file 213 to include up to 16 registers. Theembodiment of FIG. 6 implements only 8 registers to reduce circuit sizeand complexity. Each register of M1/N1 local register file 213 can beread from or written to as 64-bits of scalar data. All scalar datapathside A 115 functional units (L1 unit 221, S1 unit 222, M1 unit 223, N1unit 224, D1 unit 225 and D2 unit 226) can write to M1/N1 local scalarregister file 213. Only M1 unit 223 and N1 unit 224 can read from M1/N1local scalar register file 213.

FIG. 7 illustrates global vector register file 231. There are 16independent 512-bit wide scalar registers. Each register of globalvector register file 231 can be read from or written to as 64-bits ofscalar data designated B0 to B15. Each register of global vectorregister file 231 can be read from or written to as 512-bits of vectordata designated VB0 to VB15. The instruction type determines the datasize. All vector datapath side B 116 functional units (L2 unit 241, S2unit 242, M2 unit 243, N2 unit 244, C unit 245 and P unit 246) can reador write to global vector register file 231. Scalar datapath side A 115functional units (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1unit 225 and D2 unit 226) can read from global vector register file 231via crosspath 117 under restrictions that will be detailed below.

FIG. 8 illustrates P local register file 234. There are 8 independent64-bit wide registers designated P0 to P15. Each register of P localregister file 234 can be read from or written to as 64-bits of scalardata. Vector datapath side B 116 functional units L2 unit 241, S2 unit242, C unit 244 and P unit 246 can write to P local register file 234.Only L2 unit 241, S2 unit 242 and P unit 246 can read from P localscalar register file 234. A commonly expected use of P local registerfile 234 includes: writing one bit SIMD vector comparison results fromL2 unit 241, S2 unit 242 or C unit 244; manipulation of the SIMD vectorcomparison results by P unit 246; and use of the manipulated results incontrol of a further SIMD vector operation.

FIG. 9 illustrates L2/S2 local register file 232. The embodimentillustrated in FIG. 9 has 8 independent 512-bit wide scalar registers.The preferred instruction coding (see FIG. 13) permits L2/S2 localregister file 232 to include up to 16 registers. The embodiment of FIG.9 implements only 8 registers to reduce circuit size and complexity.Each register of L2/S2 local vector register file 232 can be read fromor written to as 64-bits of scalar data designated BL0 to BL7. Eachregister of L2/S2 local vector register file 232 can be read from orwritten to as 512-bits of vector data designated VBL0 to VBL7. Theinstruction type determines the data size. All vector datapath side B116 functional units (L2 unit 241, S2 unit 242, M2 unit 243, N2 unit244, C unit 245 and P unit 246) can write to L2/S2 local vector registerfile 232. Only L2 unit 241 and S2 unit 242 can read from L2/S2 localvector register file 232.

FIG. 10 illustrates M2/N2/C local register file 233. The embodimentillustrated in FIG. 10 has 8 independent 512-bit wide scalar registers.The preferred instruction coding (see FIG. 13) permits M2/N2/C localregister file 233 to include up to registers. The embodiment of FIG. 10implements only 8 registers to reduce circuit size and complexity. Eachregister of M2/N2/C local vector register file 233 can be read from orwritten to as 64-bits of scalar data designated BM0 to BM7. Eachregister of M2/N2/C local vector register file 233 can be read from orwritten to as 512-bits of vector data designated VBM0 to VBM7. Allvector datapath side B 116 functional units (L2 unit 241, S2 unit 242,M2 unit 243, N2 unit 244, C unit 245 and P unit 246) can write toM2/N2/C local vector register file 233. Only M2 unit 243, N2 unit 244and C unit 245 can read from M2/N2/C local vector register file 233.

The provision of global register files accessible by all functionalunits of a side and local register files accessible by only some of thefunctional units of a side is a design choice. This invention could bepracticed employing only one type of register file corresponding to thedisclosed global register files.

Crosspath 117 permits limited exchange of data between scalar datapathside A 115 and vector datapath side B 116. During each operational cycleone 64-bit data word can be recalled from global scalar register file A211 for use as an operand by one or more functional units of vectordatapath side B 116 and one 64-bit data word can be recalled from globalvector register file 231 for use as an operand by one or more functionalunits of scalar datapath side A 115. Any scalar datapath side A 115functional unit (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1unit 225 and D2 unit 226) may read a 64-bit operand from global vectorregister file 231. This 64-bit operand is the least significant bits ofthe 512-bit data in the accessed register of global vector register file231. Plural scalar datapath side A 115 functional units may employ thesame 64-bit crosspath data as an operand during the same operationalcycle. However, only one 64-bit operand is transferred from vectordatapath side B 116 to scalar datapath side A 115 in any singleoperational cycle. Any vector datapath side B 116 functional unit (L2unit 241, S2 unit 242, M2 unit 243, N2 unit 244, C unit 245 and P unit246) may read a 64-bit operand from global scalar register file 211. Ifthe corresponding instruction is a scalar instruction, the crosspathoperand data is treated as any other 64-bit operand. If thecorresponding instruction is a vector instruction, the upper 448 bits ofthe operand are zero filled. Plural vector datapath side B 116functional units may employ the same 64-bit crosspath data as an operandduring the same operational cycle. Only one 64-bit operand istransferred from scalar datapath side A 115 to vector datapath side B116 in any single operational cycle.

Streaming engine 125 transfers data in certain restricted circumstances.Streaming engine 125 controls two data streams. A stream consists of asequence of elements of a particular type. Programs that operate onstreams read the data sequentially, operating on each element in turn.Every stream has the following basic properties. The stream data have awell-defined beginning and ending in time. The stream data have fixedelement size and type throughout the stream. The stream data have fixedsequence of elements. Thus programs cannot seek randomly within thestream. The stream data is read-only while active. Programs cannot writeto a stream while simultaneously reading from it. Once a stream isopened streaming engine 125: calculates the address; fetches the defineddata type from level two unified cache (which may require cache servicefrom a higher level memory); performs data type manipulation such aszero extension, sign extension, data element sorting/swapping such asmatrix transposition; and delivers the data directly to the programmeddata register file within central processing unit core 110. Streamingengine 125 is thus useful for real-time digital filtering operations onwell-behaved data. Streaming engine 125 frees these memory fetch tasksfrom the corresponding central processing unit core 110 enabling otherprocessing functions.

Streaming engine 125 provides the following benefits. Streaming engine125 permits multi-dimensional memory accesses. Streaming engine 125increases the available bandwidth to the functional units. Streamingengine 125 minimizes the number of cache miss stalls since the streambuffer bypasses level one data cache 123. Streaming engine 125 reducesthe number of scalar operations required to maintain a loop. Streamingengine 125 manages address pointers. Streaming engine 125 handlesaddress generation automatically freeing up the address generationinstruction slots and D1 unit 225 and D2 unit 226 for othercomputations.

Central processing unit core 110 operates on an instruction pipeline.Instructions are fetched in instruction packets of fixed length furtherdescribed below. All instructions require the same number of pipelinephases for fetch and decode, but require a varying number of executephases.

FIG. 11 illustrates the following pipeline phases: program fetch phase1110, dispatch and decode phases 1120 and execution phases 1130. Programfetch phase 1110 includes three stages for all instructions. Dispatchand decode phases 1120 include three stages for all instructions.Execution phase 1130 includes one to four stages dependent on theinstruction.

Fetch phase 1110 includes program address generation stage 1111 (PG),program access stage 1112 (PA) and program receive stage 1113 (PR).During program address generation stage 1111 (PG), the program addressis generated in central processing unit core 110 and the read request issent to the memory controller for the level one instruction cache L1I.During the program access stage 1112 (PA) the level one instructioncache L1I processes the request, accesses the data in its memory andsends a fetch packet to the central processing unit core 110 boundary.During the program receive stage 1113 (PR) central processing unit core110 registers the fetch packet.

Instructions are always fetched sixteen 32-bit wide slots, constitutinga fetch packet, at a time. FIG. 12 illustrates 16 instructions 1201 to1216 of a single fetch packet. Fetch packets are aligned on 512-bit(16-word) boundaries. The preferred embodiment employs a fixed 32-bitinstruction length. Fixed length instructions are advantageous forseveral reasons. Fixed length instructions enable easy decoderalignment. A properly aligned instruction fetch can load pluralinstructions into parallel instruction decoders. Such a properly alignedinstruction fetch can be achieved by predetermined instruction alignmentwhen stored in memory (fetch packets aligned on 512-bit boundaries)coupled with a fixed instruction packet fetch. An aligned instructionfetch permits operation of parallel decoders on instruction-sizedfetched bits. Variable length instructions require an initial step oflocating each instruction boundary before they can be decoded. A fixedlength instruction set generally permits more regular layout ofinstruction fields. This simplifies the construction of each decoderwhich is an advantage for a wide issue VLIW central processor.

The execution of the individual instructions is partially controlled bya p bit in each instruction. This p bit is preferably bit 0 of the32-bit wide slot. The p bit determines whether an instruction executesin parallel with a next instruction. Instructions are scanned from lowerto higher address. If the p bit of an instruction is 1, then the nextfollowing instruction (higher memory address) is executed in parallelwith (in the same cycle as) that instruction. If the p bit of aninstruction is 0, then the next following instruction is executed in thecycle after the instruction.

Central processing unit core 110 and level one instruction cache L1I 121pipelines are de-coupled from each other. Fetch packet returns fromlevel one instruction cache L1I can take different number of clockcycles, depending on external circumstances such as whether there is ahit in level one instruction cache 121 or a hit in level two combinedcache 130. Therefore program access stage 1112 (PA) can take severalclock cycles instead of 1 clock cycle as in the other stages.

The instructions executing in parallel constitute an execute packet. Inthe preferred embodiment an execute packet can contain up to sixteeninstructions. No two instructions in an execute packet may use the samefunctional unit. A slot is one of five types: 1) a self-containedinstruction executed on one of the functional units of centralprocessing unit core 110 (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit224, D1 unit 225, D2 unit 226, L2 unit 241, S2 unit 242, M2 unit 243, N2unit 244, C unit 245 and P unit 246); 2) a unitless instruction such asa NOP (no operation) instruction or multiple NOP instruction; 3) abranch instruction; 4) a constant field extension; and 5) a conditionalcode extension. Some of these slot types will be further explainedbelow.

Dispatch and decode phases 1110 include instruction dispatch toappropriate execution unit stage 1121 (DS), instruction pre-decode stage1122 (DC1), and instruction decode, operand reads stage 1123 (DC2).During instruction dispatch to appropriate execution unit stage 1121(DS), the fetch packets are split into execute packets and assigned tothe appropriate functional units. During the instruction pre-decodestage 1122 (DC1), the source registers, destination registers andassociated paths are decoded for the execution of the instructions inthe functional units. During the instruction decode, operand reads stage1123 (DC2), more detailed unit decodes are done, as well as readingoperands from the register files.

Execution phases 1130 includes execution stages 1131 to 1135 (E1 to E5).Different types of instructions require different numbers of thesestages to complete their execution. These stages of the pipeline play animportant role in understanding the device state at central processingunit core 110 cycle boundaries.

During execute 1 stage 1131 (E1) the conditions for the instructions areevaluated and operands are operated on. As illustrated in FIG. 11,execute 1 stage 1131 may receive operands from a stream buffer 1141 andone of the register files shown schematically as 1142. For load andstore instructions, address generation is performed and addressmodifications are written to a register file. For branch instructions,branch fetch packet in PG phase 1111 is affected. As illustrated in FIG.11, load and store instructions access memory here shown schematicallyas memory 1151. For single-cycle instructions, results are written to adestination register file. This assumes that any conditions for theinstructions are evaluated as true. If a condition is evaluated asfalse, the instruction does not write any results or have any pipelineoperation after execute 1 stage 1131.

During execute 2 stage 1132 (E2) load instructions send the address tomemory. Store instructions send the address and data to memory.Single-cycle instructions that saturate results set the SAT bit in thecontrol status register (CSR) if saturation occurs. For 2-cycleinstructions, results are written to a destination register file.

During execute 3 stage 1133 (E3) data memory accesses are performed. Anymultiply instructions that saturate results set the SAT bit in thecontrol status register (CSR) if saturation occurs. For 3-cycleinstructions, results are written to a destination register file.

During execute 4 stage 1134 (E4) load instructions bring data to thecentral processing unit core 110 boundary. For 4-cycle instructions,results are written to a destination register file.

During execute 5 stage 1135 (E5) load instructions write data into aregister. This is illustrated schematically in FIG. 11 with input frommemory 1151 to execute 5 stage 1135.

FIG. 13 illustrates an example of the instruction coding 1300 offunctional unit instructions used by this invention. Those skilled inthe art would realize that other instruction codings are feasible andwithin the scope of this invention. Each instruction consists of 32 bitsand controls the operation of one of the individually controllablefunctional units (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1unit 225, D2 unit 226, L2 unit 241, S2 unit 242, M2 unit 243, N2 unit244, C unit 245 and P unit 246). The bit fields are defined as follows.

The creg field 1301 (bits 29 to 31) and the z bit 1302 (bit 28) areoptional fields used in conditional instructions. These bits are usedfor conditional instructions to identify the predicate register and thecondition. The z bit 1302 (bit 28) indicates whether the predication isbased upon zero or not zero in the predicate register. If z=1, the testis for equality with zero. If z=0, the test is for nonzero. The case ofcreg=0 and z=0 is treated as always true to allow unconditionalinstruction execution. The creg field 1301 and the z field 1302 areencoded in the instruction as shown in Table 1.

TABLE 1 Conditional creg z Register 31 30 29 28 Unconditional 0 0 0 0Reserved 0 0 0 1 A0 0 0 1 z A1 0 1 0 z A2 0 1 1 z A3 1 0 0 z A4 1 0 1 zA5 1 1 0 z Reserved 1 1 x x

Execution of a conditional instruction is conditional upon the valuestored in the specified data register. This data register is in theglobal scalar register file 211 for all functional units. Note that “z”in the z bit column refers to the zero/not zero comparison selectionnoted above and “x” is a don't care state. This coding can only specifya subset of the 16 global registers as predicate registers. Thisselection was made to preserve bits in the instruction coding. Note thatunconditional instructions do not have these optional bits. Forunconditional instructions these bits in fields 1301 and 1302 (28 to 31)are preferably used as additional opcode bits.

The dst field 1303 (bits 23 to 27) specifies a register in acorresponding register file as the destination of the instructionresults.

The src2/cst field 1304 (bits 18 to 22) has several meanings dependingon the instruction opcode field (bits 3 to 12 for all instructions andadditionally bits 28 to 31 for unconditional instructions). The firstmeaning specifies a register of a corresponding register file as thesecond operand. The second meaning is an immediate constant. Dependingon the instruction type, this is treated as an unsigned integer and zeroextended to a specified data length or is treated as a signed integerand sign extended to the specified data length.

The src1 field 1305 (bits 13 to 17) specifies a register in acorresponding register file as the first source operand. The opcodefield 1306 (bits 3 to 12) for all instructions (and additionally bits 28to 31 for unconditional instructions) specifies the type of instructionand designates appropriate instruction options. This includesunambiguous designation of the functional unit used and operationperformed. A detailed explanation of the opcode is beyond the scope ofthis invention except for the instruction options detailed below.

The e bit 1307 (bit 2) is only used for immediate constant instructionswhere the constant may be extended. If e=1, then the immediate constantis extended in a manner detailed below. If e=0, then the immediateconstant is not extended. In that case the immediate constant isspecified by the src2/cst field 1304 (bits 18 to 22). Note that this ebit 1307 is used for only some instructions. Accordingly, with propercoding this e bit 1307 may be omitted from instructions which do notneed it and this bit used as an additional opcode bit.

The s bit 1308 (bit 1) designates scalar datapath side A 115 or vectordatapath side B 116. If s=0, then scalar datapath side A 115 isselected. This limits the functional unit to L1 unit 221, S1 unit 222,M1 unit 223, N1 unit 224, D1 unit 225 and D2 unit 226 and thecorresponding register files illustrated in FIG. 2. Similarly, s=1selects vector datapath side B 116 limiting the functional unit to L2unit 241, S2 unit 242, M2 unit 243, N2 unit 244, P unit 246 and thecorresponding register file illustrated in FIG. 2.

The p bit 1309 (bit 0) marks the execute packets. The p-bit determineswhether the instruction executes in parallel with the followinginstruction. The p-bits are scanned from lower to higher address. If p=1for the current instruction, then the next instruction executes inparallel with the current instruction. If p=0 for the currentinstruction, then the next instruction executes in the cycle after thecurrent instruction. All instructions executing in parallel constitutean execute packet. An execute packet can contain up to twelveinstructions. Each instruction in an execute packet must use a differentfunctional unit.

There are two different condition code extension slots. Each executepacket can contain one each of these unique 32-bit condition codeextension slots which contains the 4-bit creg/z fields for theinstructions in the same execute packet. FIG. 14 illustrates the codingfor condition code extension slot 0 and FIG. 15 illustrates the codingfor condition code extension slot 1.

FIG. 14 illustrates the coding for condition code extension slot 0having 32 bits. Field 1401 (bits 28 to 31) specify 4 creg/z bitsassigned to the L1 unit 221 instruction in the same execute packet.Field 1402 (bits 27 to 24) specify 4 creg/z bits assigned to the L2 unit241 instruction in the same execute packet. Field 1403 (bits 19 to 23)specify 4 creg/z bits assigned to the S1 unit 222 instruction in thesame execute packet. Field 1404 (bits 16 to 19) specify 4 creg/z bitsassigned to the S2 unit 242 instruction in the same execute packet.Field 1405 (bits 12 to 15) specify 4 creg/z bits assigned to the D1 unit225 instruction in the same execute packet. Field 1406 (bits 8 to 11)specify 4 creg/z bits assigned to the D2 unit 245 instruction in thesame execute packet. Field 1407 (bits 6 and 7) is unused/reserved. Field1408 (bits 0 to 5) are coded a set of unique bits (CCEX0) to identifythe condition code extension slot 0. Once this unique ID of conditioncode extension slot 0 is detected, the corresponding creg/z bits areemployed to control conditional execution of any L1 unit 221, L2 unit241, S1 unit 222, S2 unit 242, D1 unit 225 and D2 unit 226 instructionin the same execution packet. These creg/z bits are interpreted as shownin Table 1. If the corresponding instruction is conditional (includescreg/z bits) the corresponding bits in the condition code extension slot0 override the condition code bits in the instruction. Note that noexecution packet can have more than one instruction directed to aparticular execution unit. No execute packet of instructions can containmore than one condition code extension slot 0. Thus the mapping ofcreg/z bits to functional unit instruction is unambiguous. Setting thecreg/z bits equal to “0000” makes the instruction unconditional. Thus aproperly coded condition code extension slot 0 can make somecorresponding instructions conditional and some unconditional.

FIG. 15 illustrates the coding for condition code extension slot 1having 32 bits. Field 1501 (bits 28 to 31) specify 4 creg/z bitsassigned to the M1 unit 223 instruction in the same execute packet.Field 1502 (bits 27 to 24) specify 4 creg/z bits assigned to the M2 unit243 instruction in the same execute packet. Field 1503 (bits 19 to 23)specify 4 creg/z bits assigned to the C unit 245 instruction in the sameexecute packet. Field 1504 (bits 16 to 19) specify 4 creg/z bitsassigned to the N1 unit 224 instruction in the same execute packet.Field 1505 (bits 12 to 15) specify 4 creg/z bits assigned to the N2 unit244 instruction in the same execute packet. Field 1506 (bits 6 to 11) isunused/reserved. Field 1507 (bits 0 to 5) are coded a set of unique bits(CCEX1) to identify the condition code extension slot 1. Once thisunique ID of condition code extension slot 1 is detected, thecorresponding creg/z bits are employed to control conditional executionof any M1 unit 223, M2 unit 243, C unit 245, N1 unit 224 and N2 unit 244instruction in the same execution packet. These creg/z bits areinterpreted as shown in Table 1. If the corresponding instruction isconditional (includes creg/z bits) the corresponding bits in thecondition code extension slot 1 override the condition code bits in theinstruction. Note that no execution packet can have more than oneinstruction directed to a particular execution unit. No execute packetof instructions can contain more than one condition code extension slot1. Thus the mapping of creg/z bits to functional unit instruction isunambiguous. Setting the creg/z bits equal to “0000” makes theinstruction unconditional. Thus a properly coded condition codeextension slot 1 can make some instructions conditional and someunconditional.

It is feasible for both condition code extension slot 0 and conditioncode extension slot 1 to include a p bit to define an execute packet asdescribed above in conjunction with FIG. 13. In the preferredembodiment, as illustrated in FIGS. 14 and 15, code extension slot 0 andcondition code extension slot 1 preferably have bit 0 (p bit) alwaysencoded as 1. Thus neither condition code extension slot 0 nor conditioncode extension slot 1 can be in the last instruction slot of an executepacket.

There are two different constant extension slots. Each execute packetcan contain one each of these unique 32-bit constant extension slotswhich contains 27 bits to be concatenated as high order bits with the5-bit constant field 1305 to form a 32-bit constant. As noted in theinstruction coding description above only some instructions define thesrc2/cst field 1304 as a constant rather than a source registeridentifier. At least some of those instructions may employ a constantextension slot to extend this constant to 32 bits.

FIG. 16 illustrates the fields of constant extension slot 0. Eachexecute packet may include one instance of constant extension slot 0 andone instance of constant extension slot 1. FIG. 16 illustrates thatconstant extension slot 0 1600 includes two fields. Field 1601 (bits 5to 31) constitute the most significant 27 bits of an extended 32-bitconstant including the target instruction scr2/cst field 1304 as thefive least significant bits. Field 1602 (bits 0 to 4) are coded a set ofunique bits (CSTX0) to identify the constant extension slot 0. In thepreferred embodiment constant extension slot 0 1600 can only be used toextend the constant of one of an L1 unit 221 instruction, data in a D1unit 225 instruction, an S2 unit 242 instruction, an offset in a D2 unit226 instruction, an M2 unit 243 instruction, an N2 unit 244 instruction,a branch instruction, or a C unit 245 instruction in the same executepacket. Constant extension slot 1 is similar to constant extension slot0 except that bits 0 to 4 are coded a set of unique bits (CSTX1) toidentify the constant extension slot 1. In the preferred embodimentconstant extension slot 1 can only be used to extend the constant of oneof an L2 unit 241 instruction, data in a D2 unit 226 instruction, an S1unit 222 instruction, an offset in a D1 unit 225 instruction, an M1 unit223 instruction or an N1 unit 224 instruction in the same executepacket.

Constant extension slot 0 and constant extension slot 1 are used asfollows. The target instruction must be of the type permitting constantspecification. As known in the art this is implemented by replacing oneinput operand register specification field with the least significantbits of the constant as described above with respect to scr2/cst field1304. Instruction decoder 113 determines this case, known as animmediate field, from the instruction opcode bits. The targetinstruction also includes one constant extension bit (e bit 1307)dedicated to signaling whether the specified constant is not extended(preferably constant extension bit=0) or the constant is extended(preferably constant extension bit=1). If instruction decoder 113detects a constant extension slot 0 or a constant extension slot 1, itfurther checks the other instructions within that execute packet for aninstruction corresponding to the detected constant extension slot. Aconstant extension is made only if one corresponding instruction has aconstant extension bit (e bit 1307) equal to 1.

FIG. 17 is a partial block diagram 1700 illustrating constant extension.FIG. 17 assumes that instruction decoder 113 detects a constantextension slot and a corresponding instruction in the same executepacket. Instruction decoder 113 supplies the 27 extension bits from theconstant extension slot (bit field 1601) and the 5 constant bits (bitfield 1305) from the corresponding instruction to concatenator 1701.Concatenator 1701 forms a single 32-bit word from these two parts. Inthe preferred embodiment the 27 extension bits from the constantextension slot (bit field 1601) are the most significant bits and the 5constant bits (bit field 1305) are the least significant bits. Thiscombined 32-bit word is supplied to one input of multiplexer 1702. The 5constant bits from the corresponding instruction field 1305 supply asecond input to multiplexer 1702. Selection of multiplexer 1702 iscontrolled by the status of the constant extension bit. If the constantextension bit (e bit 1307) is 1 (extended), multiplexer 1702 selects theconcatenated 32-bit input. If the constant extension bit is 0 (notextended), multiplexer 1702 selects the 5 constant bits from thecorresponding instruction field 1305. Multiplexer 1702 supplies thisoutput to an input of sign extension unit 1703.

Sign extension unit 1703 forms the final operand value from the inputfrom multiplexer 1703. Sign extension unit 1703 receives control inputsScalar/Vector and Data Size. The Scalar/Vector input indicates whetherthe corresponding instruction is a scalar instruction or a vectorinstruction. The functional units of data path side A 115 (L1 unit 221,S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225 and D2 unit 226) canonly perform scalar instructions. Any instruction directed to one ofthese functional units is a scalar instruction. Data path side Bfunctional units L2 unit 241, S2 unit 242, M2 unit 243, N2 unit 244 andC unit 245 may perform scalar instructions or vector instructions.Instruction decoder 113 determines whether the instruction is a scalarinstruction or a vector instruction from the opcode bits. P unit 246 mayonly perform scalar instructions. The Data Size may be 8 bits (byte B),16 bits (half-word H), 32 bits (word W) or 64 bits (double word D).

Table 2 lists the operation of sign extension unit 1703 for the variousoptions.

TABLE 2 Instruction Operand Constant Type Size Length Action ScalarB/H/W/D  5 bits Sign extend to 64 bits Scalar B/H/W/D 32 bits Signextend to 64 bits Vector B/H/W/D  5 bits Sign extend to operand size andreplicate across whole vector Vector B/H/W 32 bits Replicate 32-bitconstant across each 32-bit (W) lane Vector D 32 bits Sign extend to 64bits and replicate across each 64-bit (D) lane

It is feasible for both constant extension slot 0 and constant extensionslot 1 to include a p bit to define an execute packet as described abovein conjunction with FIG. 13. In the preferred embodiment, as in the caseof the condition code extension slots, constant extension slot 0 andconstant extension slot 1 preferably have bit 0 (p bit) always encodedas 1. Thus neither constant extension slot 0 nor constant extension slot1 can be in the last instruction slot of an execute packet.

It is technically feasible for an execute packet to include a constantextension slot 0 or 1 and more than one corresponding instruction markedconstant extended (e bit=1). For constant extension slot 0 this wouldmean more than one of an L1 unit 221 instruction, data in a D1 unit 225instruction, an S2 unit 242 instruction, an offset in a D2 unit 226instruction, an M2 unit 243 instruction or an N2 unit 244 instruction inan execute packet have an e bit of 1. For constant extension slot 1 thiswould mean more than one of an L2 unit 241 instruction, data in a D2unit 226 instruction, an S1 unit 222 instruction, an offset in a D1 unit225 instruction, an M1 unit 223 instruction or an N1 unit 224instruction in an execute packet have an e bit of 1. Supplying the sameconstant extension to more than one instruction is not expected to be auseful function. Accordingly, in one embodiment instruction decoder 113may determine this case an invalid operation and not supported.Alternately, this combination may be supported with extension bits ofthe constant extension slot applied to each corresponding functionalunit instruction marked constant extended.

Special vector predicate instructions use registers in predicateregister file 234 to control vector operations. In the currentembodiment all these SIMD vector predicate instructions operate onselected data sizes. The data sizes may include byte (8 bit) data, halfword (16 bit) data, word (32 bit) data, double word (64 bit) data, quadword (128 bit) data and half vector (256 bit) data. Each bit of thepredicate register controls whether a SIMD operation is performed uponthe corresponding byte of data. The operations of P unit 245 permit avariety of compound vector SIMD operations based upon more than onevector comparison. For example a range determination can be made usingtwo comparisons. A candidate vector is compared with a first vectorreference having the minimum of the range packed within a first dataregister. A second comparison of the candidate vector is made with asecond reference vector having the maximum of the range packed within asecond data register. Logical combinations of the two resultingpredicate registers would permit a vector conditional operation todetermine whether each data part of the candidate vector is within rangeor out of range.

L1 unit 221, S1 unit 222, L2 unit 241, S2 unit 242 and C unit 245 oftenoperate in a single instruction multiple data (SIMD) mode. In this SIMDmode the same instruction is applied to packed data from the twooperands. Each operand holds plural data elements disposed inpredetermined slots. SIMD operation is enabled by carry control at thedata boundaries. Such carry control enables operations on varying datawidths.

FIG. 18 illustrates the carry control. AND gate 1801 receives the carryoutput of bit N within the operand wide arithmetic logic unit (64 bitsfor scalar datapath side A 115 functional units and 512 bits for vectordatapath side B 116 functional units). AND gate 1801 also receives acarry control signal which will be further explained below. The outputof AND gate 1801 is supplied to the carry input of bit N+1 of theoperand wide arithmetic logic unit. AND gates such as AND gate 1801 aredisposed between every pair of bits at a possible data boundary. Forexample, for 8-bit data such an AND gate will be between bits 7 and 8,bits 15 and 16, bits 23 and 24, etc. Each such AND gate receives acorresponding carry control signal. If the data size is the minimum,then each carry control signal is 0, effectively blocking carrytransmission between the adjacent bits. The corresponding carry controlsignal is 1 if the selected data size requires both arithmetic logicunit sections. Table 3 below shows example carry control signals for thecase of a 512 bit wide operand such as used by vector datapath side B116 functional units which may be divided into sections of 8 bits, 16bits, 32 bits, 64 bits, 128 bits or 256 bits. In Table 3 the upper 32bits control the upper bits (bits 128 to 511) carries and the lower 32bits control the lower bits (bits 0 to 127) carries. No control of thecarry output of the most significant bit is needed, thus only 63 carrycontrol signals are required.

TABLE 3 Data Size Carry Control Signals  8 bits (B) −000 0000 0000 00000000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000 0000  16 bits (H)−101 0101 0101 0101 0101 0101 0101 0101 0101 0101 0101 0101 0101 01010101 0101  32 bits (W) −111 0111 0111 0111 0111 0111 0111 0111 0111 01110111 0111 0111 0111 0111 0111  64 bits (D) −111 1111 0111 1111 0111 11110111 1111 0111 1111 0111 1111 0111 1111 0111 1111 128 bits −111 11111111 1111 0111 1111 1111 1111 0111 1111 1111 1111 0111 1111 1111 1111256 bits −111 1111 1111 1111 1111 1111 1111 1111 0111 1111 1111 11111111 1111 1111 1111

It is typical in the art to operate on data sizes that are integralpowers of 2 (2N). However, this carry control technique is not limitedto integral powers of 2. One skilled in the art would understand how toapply this technique to other data sizes and other operand widths.

FIG. 19 illustrates a conceptual view of the streaming engines of thisinvention. FIG. 19 illustrates the process of a single stream. Streamingengine 1900 includes stream address generator 1901. Stream addressgenerator 1901 sequentially generates addresses of the elements of thestream and supplies these element addresses to system memory 1910.Memory 1910 recalls data stored at the element addresses (data elements)and supplies these data elements to data first-in-first-out (FIFO)memory 1902. Data FIFO 1902 provides buffering between memory 1910 andCPU 1920. Data formatter 1903 receives the data elements from data FIFOmemory 1902 and provides data formatting according to the streamdefinition. This process will be described below. Streaming engine 1900supplies the formatted data elements from data formatter 1903 to the CPU1920. The program on CPU 1920 consumes the data and generates an output.

Stream elements typically reside in normal memory. The memory itselfimposes no particular structure upon the stream. Programs define streamsand therefore impose structure, by specifying the following streamattributes: address of the first element of the stream; size and type ofthe elements in the stream; formatting for data in the stream; and theaddress sequence associated with the stream.

The streaming engine defines an address sequence for elements of thestream in terms of a pointer walking through memory. A multiple-levelnested loop controls the path the pointer takes. An iteration count fora loop level indicates the number of times that level repeats. Adimension gives the distance between pointer positions of that looplevel.

In a basic forward stream the innermost loop always consumes physicallycontiguous elements from memory. The implicit dimension of thisinnermost loop is 1 element. The pointer itself moves from element toelement in consecutive, increasing order. In each level outside theinner loop, that loop moves the pointer to a new location based on thesize of that loop level's dimension.

This form of addressing allows programs to specify regular paths throughmemory in a small number of parameters. Table 4 lists the addressingparameters of a basic stream.

TABLE 4 Parameter Definition ELEM_BYTES Size of each element in bytesICNT0 Number of iterations for the innermost loop level 0. At loop level0 all elements are physically contiguous DIM0 is ELEM_BYTES ICNT1 Numberof iterations for loop level 1 DIM1 Number of bytes between the startingpoints for consecutive iterations of loop level 1 ICNT2 Number ofiterations for loop level 2 DIM2 Number of bytes between the startingpoints for consecutive iterations of loop level 2 ICNT3 Number ofiterations for loop level 3 DIM3 Number of bytes between the startingpoints for consecutive iterations of loop level 3 ICNT4 Number ofiterations for loop level 4 DIM4 Number of bytes between the startingpoints for consecutive iterations of loop level 4 ICNT5 Number ofiterations for loop level 5 DIM5 Number of bytes between the startingpoints for consecutive iterations of loop level 5

The definition above maps consecutive elements of the stream toincreasing addresses in memory. This works well for most algorithms butnot all. Some algorithms are better served by reading elements indecreasing memory addresses, reverse stream addressing. For example, adiscrete convolution computes vector dot-products, as per the formula:

${\left( {f,g} \right)\lbrack t\rbrack} = {\sum\limits_{x = \infty}^{\infty}{{f\lbrack x\rbrack}{g\left\lbrack {t - x} \right\rbrack}}}$

In most DSP code, f[ ] and g[ ] represent arrays in memory. For eachoutput, the algorithm reads f[ ] in the forward direction, but reads g[] in the reverse direction. Practical filters limit the range of indicesfor [x] and [t−x] to a finite number elements. To support this pattern,the streaming engine supports reading elements in decreasing addressorder.

Matrix multiplication presents a unique problem to the streaming engine.Each element in the matrix product is a vector dot product between a rowfrom the first matrix and a column from the second. Programs typicallystore matrices all in row-major or column-major order. Row-major orderstores all the elements of a single row contiguously in memory.Column-major order stores all elements of a single column contiguouslyin memory. Matrices typically get stored in the same order as thedefault array order for the language. As a result, only one of the twomatrices in a matrix multiplication map on to the streaming engine's2-dimensional stream definition. In a typical example a first indexsteps through columns on array first array but rows on second array.This problem is not unique to the streaming engine. Matrixmultiplication's access pattern fits poorly with most general-purposememory hierarchies. Some software libraries transposed one of the twomatrices, so that both get accessed row-wise (or column-wise) duringmultiplication. The streaming engine supports implicit matrixtransposition with transposed streams. Transposed streams avoid the costof explicitly transforming the data in memory. Instead of accessing datain strictly consecutive-element order, the streaming engine effectivelyinterchanges the inner two loop dimensions in its traversal order,fetching elements along the second dimension into contiguous vectorlanes.

This algorithm works, but is impractical to implement for small elementsizes. Some algorithms work on matrix tiles which are multiple columnsand rows together. Therefore, the streaming engine defines a separatetransposition granularity. The hardware imposes a minimum granularity.The transpose granularity must also be at least as large as the elementsize. Transposition granularity causes the streaming engine to fetch oneor more consecutive elements from dimension 0 before moving alongdimension 1. When the granularity equals the element size, this resultsin fetching a single column from a row-major array. Otherwise, thegranularity specifies fetching 2, 4 or more columns at a time from arow-major array. This is also applicable for column-major layout byexchanging row and column in the description. A parameter GRANULEindicates the transposition granularity in bytes.

Another common matrix multiplication technique exchanges the innermosttwo loops of the matrix multiply. The resulting inner loop no longerreads down the column of one matrix while reading across the row ofanother. For example the algorithm may hoist one term outside the innerloop, replacing it with the scalar value. On a vector machine, theinnermost loop can be implements very efficiently with a singlescalar-by-vector multiply followed by a vector add. The centralprocessing unit core 110 of this invention lacks a scalar-by-vectormultiply. Programs must instead duplicate the scalar value across thelength of the vector and use a vector-by-vector multiply. The streamingengine of this invention directly supports this and related use modelswith an element duplication mode. In this mode, the streaming enginereads a granule smaller than the full vector size and replicates thatgranule to fill the next vector output.

The streaming engine treats each complex number as a single element withtwo sub-elements that give the real and imaginary (rectangular) ormagnitude and angle (polar) portions of the complex number. Not allprograms or peripherals agree what order these sub-elements shouldappear in memory. Therefore, the streaming engine offers the ability toswap the two sub-elements of a complex number with no cost. This featureswaps the halves of an element without interpreting the contents of theelement and can be used to swap pairs of sub-elements of any type, notjust complex numbers.

Algorithms generally prefer to work at high precision, but highprecision values require more storage and bandwidth than lower precisionvalues. Commonly, programs will store data in memory at low precision,promote those values to a higher precision for calculation and thendemote the values to lower precision for storage. The streaming enginesupports this directly by allowing algorithms to specify one level oftype promotion. In the preferred embodiment of this invention everysub-element may be promoted to the next larger type size with eithersign or zero extension for integer types. It is also feasible that thestreaming engine may support floating point promotion, promoting 16-bitand 32-bit floating point values to 32-bit and 64-bit formats,respectively.

The streaming engine defines a stream as a discrete sequence of dataelements, the central processing unit core 110 consumes data elementspacked contiguously in vectors. Vectors resemble streams in as much asthey contain multiple homogeneous elements with some implicit sequence.Because the streaming engine reads streams, but the central processingunit core 110 consumes vectors, the streaming engine must map streamsonto vectors in a consistent way.

Vectors consist of equal-sized lanes, each lane containing asub-element. The central processing unit core 110 designates therightmost lane of the vector as lane 0, regardless of device's currentendian mode. Lane numbers increase right-to-left. The actual number oflanes within a vector varies depending on the length of the vector andthe data size of the sub-element.

FIG. 20 illustrates a first example of lane allocation in a vector.Vector 2000 is divided into 8 64-bit lanes (8×64 bits=512 bits thevector length). Lane 0 includes bits 0 to 63; line 1 includes bits 64 to125; lane 2 includes bits 128 to 191; lane 3 includes bits 192 to 255,lane 4 includes bits 256 to 319, lane 5 includes bits 320 to 383, lane 6includes bits 384 to 447 and lane 7 includes bits 448 to 511.

FIG. 21 illustrates a second example of lane allocation in a vector.Vector 2100 is divided into 16 32-bit lanes (16×32 bits=512 bits thevector length). Lane 0 includes bits 0 to 31; line 1 includes bits 32 to63; lane 2 includes bits 64 to 95; lane 3 includes bits 96 to 127; lane4 includes bits 128 to 159; lane 5 includes bits 160 to 191; lane 6includes bits 192 to 223; lane 7 includes bits 224 to 255; lane 8includes bits 256 to 287; line 9 occupied bits 288 to 319; lane 10includes bits 320 to 351; lane 11 includes bits 352 to 383; lane 12includes bits 384 to 415; lane 13 includes bits 416 to 447; lane 14includes bits 448 to 479; and lane 15 includes bits 480 to 511.

The streaming engine maps the innermost stream dimension directly tovector lanes. It maps earlier elements within that dimension to lowerlane numbers and later elements to higher lane numbers. This is trueregardless of whether this particular stream advances in increasing ordecreasing address order. Whatever order the stream defines, thestreaming engine deposits elements in vectors in increasing-lane order.For non-complex data, it places the first element in lane 0 of the firstvector central processing unit core 110 fetches, the second in lane 1,and so on. For complex data, the streaming engine places the firstelement in lanes 0 and 1, second in lanes 2 and 3, and so on.Sub-elements within an element retain the same relative orderingregardless of the stream direction. For non-swapped complex elements,this places the sub-elements with the lower address of each pair in theeven numbered lanes, and the sub-elements with the higher address ofeach pair in the odd numbered lanes. Swapped complex elements reversethis mapping.

The streaming engine fills each vector central processing unit core 110fetches with as many elements as it can from the innermost streamdimension. If the innermost dimension is not a multiple of the vectorlength, the streaming engine pads that dimension out to a multiple ofthe vector length with zeros. Thus for higher-dimension streams, thefirst element from each iteration of an outer dimension arrives in lane0 of a vector. The streaming engine always maps the innermost dimensionto consecutive lanes in a vector. For transposed streams, the innermostdimension consists of groups of sub-elements along dimension 1, notdimension 0, as transposition exchanges these two dimensions.

Two dimensional streams exhibit great variety as compared to onedimensional streams. A basic two dimensional stream extracts a smallerrectangle from a larger rectangle. A transposed 2-D stream reads arectangle column-wise instead of row-wise. A looping stream, where thesecond dimension overlaps first executes a finite impulse response (FIR)filter taps which loops repeatedly or FIR filter samples which provide asliding window of input samples.

FIG. 22 illustrates a basic two dimensional stream. The inner twodimensions, represented by ELEM_BYTES, ICNT0, DIM1 and ICNT1 givesufficient flexibility to describe extracting a smaller rectangle 2220having dimensions 2221 and 2222 from a larger rectangle 2210 havingdimensions 2211 and 2212. In this example rectangle 2220 is a 9 by 13rectangle of 64-bit values and rectangle 2210 is a larger 11 by 19rectangle. The following stream parameters define this stream:

-   -   ICNT0=9    -   ELEM_BYTES=8    -   ICNT1=13    -   DIM1=88 (11 times 8)

Thus the iteration count in the 0 dimension 2221 is 9. The iterationcount in the 1 direction 2222 is 13. Note that the ELEM_BYTES onlyscales the innermost dimension. The first dimension has ICNT0 elementsof size ELEM_BYTES. The stream address generator does not scale theouter dimensions. Therefore, DIM1=88, which is 11 elements scaled by 8bytes per element.

FIG. 23 illustrates the order of elements within this example stream.The streaming engine fetches elements for the stream in the orderillustrated in order 2300. The first 9 elements come from the first rowof rectangle 2220, left-to-right in hops 1 to 8. The 10th through 24thelements comes from the second row, and so on. When the stream movesfrom the 9th element to the 10th element (hop 9 in FIG. 23), thestreaming engine computes the new location based on the pointer'sposition at the start of the inner loop, not where the pointer ended upat the end of the first dimension. This makes DIM1 independent ofELEM_BYTES and ICNT0. DIM1 always represents the distance between thefirst bytes of each consecutive row.

Transposed streams access along dimension 1 before dimension 0. Thefollowing examples illustrate a couple transposed streams, varying thetransposition granularity. FIG. 24 illustrates extracting a smallerrectangle 2420 (12×8) having dimensions 2421 and 2422 from a largerrectangle 2410 (14×13) having dimensions 2411 and 2412. In FIG. 24ELEM_BYTES equals 2.

FIG. 25 illustrates how the streaming engine would fetch the stream ofthis example with a transposition granularity of 4 bytes. Fetch pattern2500 fetches pairs of elements from each row (because the granularity of4 is twice the ELEM_BYTES of 2), but otherwise moves down the columns.Once it reaches the bottom of a pair of columns, it repeats this patternwith the next pair of columns.

FIG. 26 illustrates how the streaming engine would fetch the stream ofthis example with a transposition granularity of 8 bytes. The overallstructure remains the same. The streaming engine fetches 4 elements fromeach row (because the granularity of 8 is four times the ELEM_BYTES of2) before moving to the next row in the column as shown in fetch pattern2600.

The streams examined so far read each element from memory exactly once.A stream can read a given element from memory multiple times, in effectlooping over a piece of memory. FIR filters exhibit two common loopingpatterns. FIRs re-read the same filter taps for each output. FIRs alsoread input samples from a sliding window. Two consecutive outputs willneed inputs from two overlapping windows.

FIG. 27 illustrates the details of streaming engine 2700. Streamingengine 2700 contains three major sections: Stream 0 2710; Stream 1 2720;and Shared L2 Interfaces 2730. Stream 0 2710 and Stream 1 2720 bothcontain identical hardware that operates in parallel. Stream 0 2710 andStream 1 2720 both share L2 interfaces 2730. Each stream 2710 and 2720provides central processing unit core 110 with up to 512 bits/cycle,every cycle. The streaming engine architecture enables this through itsdedicated stream paths and shared dual L2 interfaces.

Each streaming engine 2700 includes a dedicated 6-dimensional streamaddress generator 2711/2721 that can each generate one new non-alignedrequest per cycle. Address generators 2711/2721 output 512-bit alignedaddresses that overlap the elements in the sequence defined by thestream parameters. This will be further described below.

Each address generator 2711/2711 connects to a dedicated micro tablelook-aside buffer (μTLB) 2712/2722. The μTLB 2712/2722 converts a single48-bit virtual address to a 44-bit physical address each cycle. EachμTLB 2712/2722 has 8 entries, covering a minimum of 32 kB with 4 kBpages or a maximum of 16 MB with 2 MB pages. Each address generator2711/2721 generates 2 addresses per cycle. The μTLB 2712/2722 onlytranslates 1 address per cycle. To maintain throughput, streaming engine2700 takes advantage of the fact that most stream references will bewithin the same 4 kB page. Thus the address translation does not modifybits 0 to 11 of the address. If aout0 and aout1 line in the same 4 kBpage (aout0[47:12] are the same as aout1[47:12]), then the μTLB2712/2722 only translates aout0 and reuses the translation for the upperbits of both addresses.

Translated addresses are queued in command queue 2713/2723. Theseaddresses are aligned with information from the corresponding StorageAllocation and Tracking block 2714/2724. Streaming engine 2700 does notexplicitly manage μTLB 2712/2722. The system memory management unit(MMU) invalidates μTLBs as necessary during context switches.

Storage Allocation and Tracking 2714/2724 manages the stream's internalstorage, discovering data reuse and tracking the lifetime of each pieceof data. This will be further described below.

Reference queue 2715/2725 stores the sequence of references generated bythe corresponding address generator 2711/2721. This information drivesthe data formatting network so that it can present data to centralprocessing unit core 110 in the correct order. Each entry in referencequeue 2715/2725 contains the information necessary to read data out ofthe data store and align it for central processing unit core 110.Reference queue 2715/2725 maintains the following information listed inTable 5 in each slot:

TABLE 5 Data Slot Low Slot number for the lower half of data associatedwith aout0 Data Slot High Slot number for the upper half of dataassociated with aout1 Rotation Number of bytes to rotate data to alignnext element with lane 0 Length Number of valid bytes in this reference

Storage allocation and tracking 2714/2724 inserts references inreference queue 2715/2725 as address generator 2711/2721 generates newaddresses. Storage allocation and tracking 2714/2724 removes referencesfrom reference queue 2715/2725 when the data becomes available and thereis room in the stream holding registers. As storage allocation andtracking 2714/2724 removes slot references from reference queue2715/2725 and formats data, it checks whether the references representthe last reference to the corresponding slots. Storage allocation andtracking 2714/2724 compares reference queue 2715/2725 removal pointeragainst the slot's recorded Last Reference. If they match, then storageallocation and tracking 2714/2724 marks the slot inactive once it's donewith the data.

Streaming engine 2700 has data storage 2716/2737 for an arbitrary numberof elements. Deep buffering allows the streaming engine to fetch farahead in the stream, hiding memory system latency. The right amount ofbuffering might vary from product generation to generation. In thecurrent preferred embodiment streaming engine 2700 dedicates 32 slots toeach stream. Each slot holds 64 bytes of data.

Butterfly network 2717/2727 consists of a 7 stage butterfly network.Butterfly network 2717/2727 receives 128 bytes of input and generates 64bytes of output. The first stage of the butterfly is actually ahalf-stage. It collects bytes from both slots that match a non-alignedfetch and merges them into a single, rotated 64-byte array. Theremaining 6 stages form a standard butterfly network. Butterfly network2717/2727 performs the following operations: rotates the next elementdown to byte lane 0; promotes data types by one power of 2, ifrequested; swaps real and imaginary components of complex numbers, ifrequested; converts big endian to little endian if central processingunit core 110 is presently in big endian mode. The user specifieselement size, type promotion and real/imaginary swap as part of thestream's parameters.

Streaming engine 2700 attempts to fetch and format data ahead of centralprocessing unit core 110's demand for it, so that it can maintain fullthroughput. Holding registers 2718/2728 provide a small amount ofbuffering so that the process remains fully pipelined. Holding registers2718/2728 are not directly architecturally visible, except for the factthat streaming engine 2700 provides full throughput.

The two streams 2710/2720 share a pair of independent L2 interfaces2730: L2 Interface A (IFA) 2733 and L2 Interface B (IFB) 2734. Each L2interface provides 512 bits/cycle throughput direct to the L2 controllerfor an aggregate bandwidth of 1024 bits/cycle. The L2 interfaces use thecredit-based multicore bus architecture (MBA) protocol. The L2controller assigns each interface its own pool of command credits. Thepool should have sufficient credits so that each interface can sendsufficient requests to achieve full read-return bandwidth when readingL2 RAM, L2 cache and multicore shared memory controller (MSMC) memory(described below).

To maximize performance, both streams can use both L2 interfaces,allowing a single stream to send a peak command rate of 2requests/cycle. Each interface prefers one stream over the other, butthis preference changes dynamically from request to request. IFA 2733and IFB 2734 always prefer opposite streams, when IFA 2733 prefersStream 0, IFB 2734 prefers Stream 1 and vice versa.

Arbiter 2731/2732 ahead of each interface 2733/2734 applies thefollowing basic protocol on every cycle it has credits available.Arbiter 2731/2732 checks if the preferred stream has a command ready tosend. If so, arbiter 2731/2732 chooses that command. Arbiter 2731/2732next checks if an alternate stream has at least two requests ready tosend, or one command and no credits. If so, arbiter 2731/2732 pulls acommand from the alternate stream. If either interface issues a command,the notion of preferred and alternate streams swap for the next request.Using this simple algorithm, the two interfaces dispatch requests asquickly as possible while retaining fairness between the two streams.The first rule ensures that each stream can send a request on everycycle that has available credits. The second rule provides a mechanismfor one stream to borrow the other's interface when the second interfaceis idle. The third rule spreads the bandwidth demand for each streamacross both interfaces, ensuring neither interface becomes a bottleneckby itself.

Coarse Grain Rotator 2735/2736 enables streaming engine 2700 to supporta transposed matrix addressing mode. In this mode, streaming engine 2700interchanges the two innermost dimensions of its multidimensional loop.This accesses an array column-wise rather than row-wise. Rotator2735/2736 is not architecturally visible, except as enabling thistransposed access mode.

The stream definition template provides the full structure of a streamthat contains data. The iteration counts and dimensions provide most ofthe structure, while the various flags provide the rest of the details.For all data-containing streams, the streaming engine defines a singlestream template. All stream types it supports fit this template. Thestreaming engine defines a six-level loop nest for addressing elementswithin the stream. Most of the fields in the stream template mapdirectly to the parameters in that algorithm. FIG. 28 illustrates streamtemplate register 2800. The numbers above the fields are bit numberswithin a 256-bit vector. Table 6 shows the stream field definitions of astream template.

TABLE 6 FIG. 28 Field Reference Size Name Number Description Bits ICNT02801 Iteration count for loop 0 16 ICNT1 2802 Iteration count for loop 116 ICNT2 2803 Iteration count for loop 2 16 ICNT3 2804 Iteration countfor loop 3 16 ICNT4 2805 Iteration count for loop 4 16 INCT5 2806Iteration count for loop 5 16 DIM1 2822 Signed dimension for loop 1 16DIM2 2823 Signed dimension for loop 2 16 DIM3 2824 Signed dimension forloop 3 16 DIM4 2825 Signed dimension for loop 4 32 DIM4 2826 Signeddimension for loop 5 32 FLAGS 2811 Stream modifier flags 48

Loop 0 is the innermost loop and loop 5 is the outermost loop. In thecurrent example DIM0 is always equal to is ELEM_BYTES definingphysically contiguous data. Thus the stream template register 2800 doesnot define DIM0. Streaming engine 2700 interprets all iteration countsas unsigned integers and all dimensions as unscaled signed integers. Thetemplate above fully specifies the type of elements, length anddimensions of the stream. The stream instructions separately specify astart address. This would typically be by specification of a scalarregister in scalar register file 211 which stores this start address.This allows a program to open multiple streams using the same template.

FIG. 29 illustrates sub-field definitions of the flags field 2811. Asshown in FIG. 29 the flags field 2811 is 6 bytes or 48 bits. FIG. 29shows bit numbers of the fields. Table 7 shows the definition of thesefields.

TABLE 7 FIG. 29 Reference Size Field Name Number Description Bits ELTYPE2901 Type of data element 4 TRANSPOSE 2902 Two dimensional transposemode 3 PROMOTE 2903 Promotion mode 3 VCLEN 2904 Stream vector length 3ELDUP 2905 Element duplication 3 GRDUP 2906 Group duplication 1 DECIM2907 Element decimation 2 THROTTLE 2908 Fetch ahead throttle mode 2DIMFMT 2909 Stream dimensions format 3 DIR 2910 Stream direction 1 0forward direction 1 reverse direction CBK0 2911 First circular blocksize number 4 CBK1 2912 Second circular block size number 4 AM0 2913Addressing mode for loop 0 2 AM1 2914 Addressing mode for loop 1 2 AM22915 Addressing mode for loop 2 2 AM3 2916 Addressing mode for loop 3 2AM4 2917 Addressing mode for loop 4 2 AM5 2918 Addressing mode for loop5 2

The Element Type (ELTYPE) field 2901 defines the data type of theelements in the stream. The coding of the four bits of the ELTYPE field2901 is defined as shown in Table 8.

TABLE 8 Sub-element Total Element ELTYPE Real/Complex Size Bits SizeBits 0000 real 8 8 0001 real 16 16 0010 real 32 32 0011 real 64 64 0100reserved 0101 reserved 0110 reserved 0111 reserved 1000 complex 8 16 noswap 1001 complex 16 32 no swap 1010 complex 32 64 no swap 1011 complex64 128 no swap 1100 complex 8 16 swapped 1101 complex 16 32 swapped 1110complex 32 64 swapped 1111 complex 64 128 swapped

Real/Complex Type determines whether the streaming engine treats eachelement as a real number or two parts (real/imaginary ormagnitude/angle) of a complex number. This field also specifies whetherto swap the two parts of complex numbers. Complex types have a totalelement size that is twice their sub-element size. Otherwise, thesub-element size equals total element size.

Sub-Element Size determines the type for purposes of type promotion andvector lane width. For example, 16-bit sub-elements get promoted to32-bit sub-elements when a stream requests type promotion. The vectorlane width matters when central processing unit core 110 operates in bigendian mode, as it always lays out vectors in little endian order.

Total Element Size determines the minimal granularity of the stream. Inthe stream addressing model, it determines the number of bytes thestream fetches for each iteration of the innermost loop. Streams alwaysread whole elements, either in increasing or decreasing order.Therefore, the innermost dimension of a stream spansICNT0×total-element-size bytes.

The TRANSPOSE field 2902 determines whether the streaming engineaccesses the stream in a transposed order. The transposed orderexchanges the inner two addressing levels. The TRANSPOSE field 2902 alsoindicated the granularity it transposes the stream. The coding of thethree bits of the TRANSPOSE field 2902 is defined as shown in Table 9for normal 2D operations.

TABLE 9 Transpose Meaning 000 Transpose disabled 001 Transpose on 8-bitboundaries 010 Transpose on 16-bit boundaries 011 Transpose on 32-bitboundaries 100 Transpose on 64-bit boundaries 101 Transpose on 128-bitboundaries 110 Transpose on 256-bit boundaries 111 Reserved

Streaming engine 2700 may transpose data elements at a differentgranularity than the element size. This allows programs to fetchmultiple columns of elements from each row. The transpose granularitymust be no smaller than the element size. The TRANSPOSE field 2902interacts with the DIMFMT field 2909 in a manner further describedbelow.

F

The PROMOTE field 2903 controls whether the streaming engine promotessub-elements in the stream and the type of promotion. When enabled,streaming engine 2700 promotes types by a powers-of-2 sizes. The codingof the three bits of the PROMOTE field 2903 is defined as shown in Table10.

TABLE 10 Promotion Promotion Resulting Sub-element Size PROMOTE FactorType 8-bit 16-bit 32-bit 64-bit 000 1× N/A  8-bit 16-bit 32-bit 64-bit001 2× zero 16-bit 32-bit 64-bit Invalid extend 010 4× zero 32-bit64-bit Invalid Invalid extend 011 8× zero 64-bit Invalid Invalid Invalidextend 100 reserved 101 2× sign 16-bit 32-bit 64-bit Invalid extend 1104× sign 32-bit 64-bit Invalid Invalid extend 111 8× sign 64-bit InvalidInvalid Invalid extend

When PROMOTE is 000, corresponding to a 1× promotion, each sub-elementis unchanged and occupies a vector lane equal in width to the sizespecified by ELTYPE. When PROMOTE is 001, corresponding to a 2×promotion and zero extend, each sub-element is treated as an unsignedinteger and zero extended to a vector lane twice the width specified byELTYPE. A 2× promotion is invalid for an initial sub-element size of 64bits. When PROMOTE is 010, corresponding to a 4× promotion and zeroextend, each sub-element is treated as an unsigned integer and zeroextended to a vector lane four times the width specified by ELTYPE. A 4×promotion is invalid for an initial sub-element size of 32 or 64 bits.When PROMOTE is 011, corresponding to an 8× promotion and zero extend,each sub-element is treated as an unsigned integer and zero extended toa vector lane eight times the width specified by ELTYPE. An 8× promotionis invalid for an initial sub-element size of 16, 32 or 64 bits. WhenPROMOTE is 101, corresponding to a 2× promotion and sign extend, eachsub-element is treated as a signed integer and sign extended to a vectorlane twice the width specified by ELTYPE. A 2× promotion is invalid foran initial sub-element size of 64 bits. When PROMOTE is 110,corresponding to a 4× promotion and sign extend, each sub-element istreated as a signed integer and sign extended to a vector lane fourtimes the width specified by ELTYPE. A 4× promotion is invalid for aninitial sub-element size of 32 or 64 bits. When PROMOTE is 111,corresponding to an 8× promotion and zero extend, each sub-element istreated as a signed integer and sign extended to a vector lane eighttimes the width specified by ELTYPE. An 8× promotion is invalid for aninitial sub-element size of 16, 32 or 64 bits.

The VECLEN field 2904 defines the stream vector length for the stream inbytes. Streaming engine 2700 breaks the stream into groups of elementsthat are VECLEN bytes long. The coding of the three bits of the VECLENfield 2904 is defined as shown in Table 11.

TABLE 11 VECLEN Stream Vector Length 000  1 byte 001  2 bytes 010  4bytes 011  8 bytes 100 16 bytes 101 32 bytes 110 64 bytes 111 Reserved

VECLEN must be greater than or equal to the product of the element sizein bytes and the duplication factor. Streaming engine 2700 presents thestream to central processing unit core 110 as either a sequence of pairsof single vectors or a sequence of double vectors. When VECLEN isshorter the native vector width of central processing unit core 110,streaming engine 2700 pads the extra lanes in the vector provided tocentral processing unit core 110. The GRDUP field 2906 determines thetype of padding. The VECLEN field 2904 interacts with ELDUP field 2905and GRDUP field 2906 in a manner detailed below.

The ELDUP field 2905 specifies a number of times to duplicate eachelement. The element size multiplied with the element duplication amountmust not exceed the 64 bytes. The coding of the three bits of the ELDUPfield 2905 is defined as shown in Table 12.

TABLE 12 ELDUP Duplication Factor 000 No Duplication 001  2 times 010  4times 011  8 times 100 16 times 101 32 times 110 64 times 111 ReservedThe ELDUP field 2905 interacts with VECLEN field 2904 and GRDUP field2906 in a manner detailed below.

The GRDUP bit 2906 determines whether group duplication is enabled. IfGRDUP bit 2906 is 0, then group duplication is disabled. If the GRDUPbit 2906 is 1, then group duplication is enabled. When enabled by GRDUPbit 2906, streaming engine 2700 duplicates a group of elements to fillthe vector width. VECLEN field 2904 defines the length of the group toreplicate. When VECLEN field 2904 is less than the vector length ofcentral processing unit core 110 and GRDUP bit 2906 enables groupduplication, streaming engine 2700 fills the extra lanes (see FIGS. 20and 21) with additional copies of the stream vector. Because streamvector lengths and vector length of central processing unit core 110 arealways powers of two, group duplication always produces a power of twoof the number of duplicate copies. GRDUP field 2906 specifies how streamengine 2700 pads stream vectors out to the vector length of centralprocessing unit core 110. When GRDUP bit 2906 is 0, streaming engine2700 fills the extra lanes with zero and marks these extra vector lanesinvalid. When GRDUP bit 2906 is 1, streaming engine 2700 fills extralanes with copies of the group of elements in each stream vector.Setting GRDUP bit 2906 to 1 has no effect when VECLEN is set to thenative vector width of central processing unit core 110.

The DECIM field 2907 controls data element decimation of thecorresponding stream. Streaming engine 2700 deletes data elements fromthe stream upon storage in head registers 2718/2728 for presentation tothe requesting functional unit. Decimation always removes whole dataelements, not sub-elements. The DECIM field 2907 is defined as listed inTable 13.

TABLE 13 DECIM Decimation Factor 00 No Decimation 01 2 times 10 4 times11 Reserved

If DECIM field 2907 equals 00, then no decimation occurs. The dataelements are passed to the corresponding head registers 2718/2728without change. If DECIM field 2907 equals 01, then 2:1 decimationoccurs. Streaming engine 2700 removes odd number elements from the datastream upon storage in the head registers 2718/2728. Limitations in theformatting network require 2:1 decimation to be employed with datapromotion by at least 2× (PROMOTE cannot be 000), ICNT0 must be multipleof 2 and the total vector length (VECLEN) must be large enough to hold asingle promoted, duplicated element. For transposed streams(TRANSPOSE≠0), the transpose granule must be at least twice the elementsize in bytes before promotion. If DECIM field 2907 equals 10, then 4:1decimation occurs. Streaming engine 2700 retains every fourth dataelement removing three elements from the data stream upon storage in thehead registers 2718/2728. Limitations in the formatting network require4:1 decimation to be employed with data promotion by at least 4×(PROMOTE cannot be 000, 001 or 101), ICNT0 must be multiple of 4 and thetotal vector length (VECLEN) must be large enough to hold a singlepromoted, duplicated element. For transposed streams (TRANSPOSE≠0),decimation always removes columns, and never removes rows. Thus thetranspose granule must be: at least twice the element size in bytesbefore promotion for 2:1 decimation (GRANULE≥2×ELEM_BYTES); and at leastfour times the element size in bytes before promotion for 4:1 decimation(GRANULE≥4×ELEM_BYTES).

The THROTTLE field 2908 controls how aggressively the streaming enginefetches ahead of central processing unit core 110. The coding of the twobits of this field is defined as shown in Table 14.

TABLE 14 THROTTLE Description 00 Minimum throttling, maximum fetch ahead01 Less throttling, more fetch ahead 10 More throttling, less fetchahead 11 Maximum throttling, minimum fetch ahead

THROTTLE does not change the meaning of the stream, and serves only as ahint. The streaming engine may ignore this field. Programs should notrely on the specific throttle behavior for program correctness, becausethe architecture does not specify the precise throttle behavior.THROTTLE allows programmers to provide hints to the hardware about theprogram's own behavior. By default, the streaming engine attempts to getas far ahead of central processing unit core 110 as it can to hide asmuch latency as possible, while providing full stream throughput tocentral processing unit core 110. While several key applications needthis level of throughput, it can lead to bad system level behavior forothers. For example, the streaming engine discards all fetched dataacross context switches. Therefore, aggressive fetch-ahead can lead towasted bandwidth in a system with large numbers of context switches.Aggressive fetch-ahead only makes sense in those systems if centralprocessing unit core 110 consumes data very quickly.

The DIMFMT field 2909 enables redefinition of the loop count fieldsICNT0 2801, ICNT1 2802, ICNT2 2803, ICNT3 2804, ICNT4 2805 and ICNT52806, the loop dimension fields DIM1 2855, DIM2 2823, DIM3 2824, DIM42825 and DIM5 2826 and the addressing mode fields AM0 2913, AM1 2914,AM2 2915, AM3 2916, AM4 2917 and AM5 2918 (part of FLAGS field 2811) ofthe stream template register 2800. This permits some loop dimensionfields and loop counts to include more bits at the expense of fewerloops. Table 15 lists the size of the loop dimension fields for variousvalues of the DIMFMT field 2909.

TABLE 15 Number of DIMFMT Loops DIM5 DIM4 DIM3 DIM2 DIM1 000 3 unused 32bits unused 32 bits unused 001 4 unused 32 bits unused 16 bits 16 bits010 4 unused 32 bits 16 bits 16 bits unused 011 5 unused 32 bits 32 bits32 bits 16 bits 100 reserved 101 reserved 110 6 16 bits 16 bits 32 bits32 bits 32 bits 111 6 32 bits 32 bits 16 bits 16 bits 32 bits

Note that DIM0 always equals ELEM_BYTES the data element size. Table 16lists the size of the loop count fields for various values of the DIMFMTfield 2909.

TABLE 16 DIMFMT Number of Loops ICNT5 ICNT4 ICNT3 ICNT2 ICNT1 ICNT0 0003 unused 32 bits unused 32 bits unused 32 bits 001 4 unused 32 bitsunused 32 bits 16 bits 16 bits 010 4 unused 32 bits 16 bits 16 bitsunused 32 bits 011 5 unused 32 bits 16 bits 16 bits 16 bits 16 bits 100reserved 101 reserved 110 6 16 bits 16 bits 16 bits 16 bits 16 bits 16bits 111 6 16 bits 16 bits 16 bits 16 bits 16 bits 16 bitsDIMFMT field 2909 effectively defines the loop dimension and loop countbits of stream template register 2800. FIG. 28 illustrates the defaultcase when DIMFMT is 111.

FIGS. 30 to 34 illustrate the definition of bits of the stream templateregister for other values of DIMFMT. Note the location and meaning ofthe FLAGS field (2811, 3011, 3111, 3211, 3311 and 3411) are the same forall values of DIMFMT

FIG. 30 illustrates the definition of bits of the stream templateregister 3000 for a DIMFMT value of 000. For a DIMFMT value of 000,there are three loops: loop0, loop2 and loop4. For loop0 ICNT0 field3001 includes bits 0 to 31 and DIM0 field equals ELEM_BYTES. For loop2ICNT2 field 3002 includes bits 32 to 63 and DIM2 field 3021 includesbits 160 to 191. For loop4 INTC4 field 3003 includes bits 64 to 95 andDIM4 field 3022 includes bits 192 to 223.

FIG. 31 illustrates the definition of bits of the stream templateregister 3100 for a DIMFMT value of 001. For a DIMFMT value of 001,there are four loops: loop0, loop1, loop2 and loop4. For loop0 ICNT0field 3101 includes bits 0 to 16 and DIM0 field equals ELEM_BYTES. Forloop1 ICNT1 field 3002 includes bits 16 to 31 and DIM1 field 3123includes bits 224 to 255. For loop2 INTC2 field 3103 includes bits 32 to63 and DIM2 field 3121 includes bits 160 to 191. For loop4 INTC4 field3104 includes bits 64 to 95 and DIM4 field 3122 includes bits 192 to223.

FIG. 32 illustrates the definition of bits of the stream templateregister 3200 for a DIMFMT value of 010. For a DIMFMT value of 010,there are four loops: loop0, loop2, loop3 and loop4. For loop0 ICNT0field 3201 includes bits 0 to 32 and DIM0 field equals ELEM_BYTES. Forloop2 ICNT2 field 3202 includes bits 32 to 47 and DIM2 field 3221includes bits 160 to 191. For loop3 INTC3 field 3203 includes bits 48 to63 and DIM3 field 3223 includes bits 224 to 255. For loop4 INTC4 field3204 includes bits 64 to 95 and DIM4 field 3222 includes bits 192 to223.

FIG. 33 illustrates the definition of bits of the stream templateregister 3300 for a DIMFMT value of 011. For a DIMFMT value of 011,there are five loops: loop0, loop1, loop2, loop3 and loop4. For loop0ICNT0 field 3401 includes bits 0 to 15 and DIM0 field equals ELEM_BYTES.For loop1 ICNT1 field 3402 includes bits 16 to 31 and DIM1 field 3421includes bits 144 to 159. For loop2 ICNT2 field 3403 includes bits 32 to47 and DIM2 field 3221 includes bits 160 to 191. For loop3 INTC3 field3204 includes bits 48 to 63 and DIM3 field 3424 includes bits 224 to255. For loop4 INTC4 field 3405 includes bits 64 to 95 and DIM4 field3423 includes bits 192 to 223.

FIG. 34 illustrates the definition of bits of the stream templateregister 3400 for a DIMFMT value of 101. For a DIMFMT value of 110,there are six loops: loop0, loop1, loop2, loop3 m loop4 and loop5. Forloop0 ICNT0 field 3501 includes bits 0 to 15 and DIM0 field equalsELEM_BYTES. For loop1 ICNT1 field 3502 includes bits 16 to 31 and DIM1field 3521 includes bits 144 to 159. For loop2 ICNT2 field 3503 includesbits 32 to 47 and DIM2 field 3522 includes bits 160 to 191. For loop3INTC3 field 3504 includes bits 48 to 63 and DIM3 field 3525 includesbits 224 to 255. For loop4 INTC4 field 3405 includes bits 64 to 79 andDIM4 field 3523 includes bits 192 to 207. For loop5 INTC5 field 3506includes bits 80 to 95 and DIM5 field 3524 includes bits 208 to 223.

The DIR bit 2910 determines the direction of fetch of the inner loop(Loop0). If the DIR bit 2910 is 0 then Loop0 fetches are in the forwarddirection toward increasing addresses. If the DIR bit 2910 is 1 thenLoop0 fetches are in the backward direction toward decreasing addresses.The fetch direction of other loops is determined by the sign of thecorresponding loop dimension DIM1, DIM2, DIM3, DIM4 and DIM5 which aresigned integers.

The CBK0 field 2911 and the CBK1 field 2912 control the circular blocksize upon selection of circular addressing. The manner of determiningthe circular block size will be more fully described below.

The AM0 field 2913, AM1 field 2914, AM2 field 2915, AM3 field 2916, AM4field 2917 and AM5 field 2918 control the addressing mode of acorresponding loop. This permits the addressing mode to be independentlyspecified for each loop. Each of AM0 field 2913, AM1 field 2914, AM2field 2915, AM3 field 2916, AM4 field 2917 and AM5 field 2918 are threebits and are decoded as listed in Table 17.

TABLE 17 AMx field Meaning 000 Linear addressing 001 Circular addressingblock size set by CBK0 010 Circular addressing block size set by CBK0 +CBK1 + 1 011 reserved

In linear addressing the address advances according to the addressarithmetic whether forward or reverse. In circular addressing theaddress remains within a defined address block. Upon reaching the end ofthe circular address block the address wraps around to other limit ofthe block. Circular addressing blocks are typically limited to 2Naddresses where N is an integer. Circular address arithmetic may operateby cutting the carry chain between bits and not allowing a selectednumber of most significant bits to change. Thus arithmetic beyond theend of the circular block changes only the least significant bits.

The block size is set as listed in Table 18.

TABLE 18 Encoded Block Size CBK0 or Block Size CBK0 + CBK1 + 1 (bytes) 0512 1  1K 2  2K 3  4K 4  8K 5  16K 6  32K 7  64K 8 128K 9 256K 10 512K11  1M 12  2M 13  4M 14  8M 15  16M 16  32M 17  64M 18 128M 19 256M 20512M 21  1 G 22  2 G 23  4 G 24  8 G 25 16 G 26 32 G 27 64 G 28 Reserved29 Reserved 30 Reserved 31 Reserved

In the preferred embodiment the circular block size is set by the numberencoded by CBK0 (first circular address mode 001) or the number encodedby CBK0+CBK1+1 (second circular address mode 010). For the firstcircular address mode, the circular address block size can be from 512bytes to 16 M bytes. For the second circular address mode, the circularaddress block size can be from 1 K bytes to 64 G bytes. Thus the encodedblock size is 2^((B+9)) bytes, where B is the encoded block number whichis CBK0 for the first block size (AMx of 001) and CBK0+CBK1+1 for thesecond block size (AMx of 010).

FIG. 35 illustrates loop count selection circuit 3500 which is anexemplary embodiment selecting data from the stream template registerfor the various loop dimensions. As illustrated in FIGS. 28 and 30 to 34the stream template register bits defining the loop counts varydependent upon the DIMFMT field. FIG. 35 illustrates bits 0 to 95 of thestream template register. These bits are divided into 6 portionsincluding: portion 3501, bits 0 to 15; portion 3502, bits 16 to 31;portion 3503, bits 32 to 47; portion 3504, bits 48 to 63; portion 3505,bits 64 to 79; and portion 3506, bits 80 to 95.

Concatenator 3511 forms a single 32-bit data word from portions 3501 and3502. Multiplexer 3512 selects either portion 3501 or the output ofconcatenator 3511 for the INCT0 output. Multiplexer 3513 selects eithera null input or portion 3502 for the INCT1 output.

Concatenator 3521 forms a single 32-bit data word from portions 3503 and3504. Multiplexer 3522 selects either portion 3503 or the output ofconcatenator 3521 for the INCT2 output. Multiplexer 3523 selects eithera null input or portion 3504 for the INCT3 output.

Concatenator 3531 forms a single 32-bit data word from portions 3505 and3506. Multiplexer 3532 selects either portion 3505 or the output ofconcatenator 3531 for the INCT4 output. Multiplexer 3533 selects eithera null input or portion 3506 for the INCT5 output.

DIMFMT ICNT decoder 3508 receives the DIMFT bits from the streamtemplate register and generates outputs controlling the selections ofmultiplexers 3512, 3513, 3522, 3523, 3532 and 3533. Table 19 lists thecontrol of these multiplexers for the various codings of the DIMFMTfield.

TABLE 19 ICNT5 ICNT4 ICNT3 ICNT2 ICNT1 ICNT0 MUX MUX MUX MUX MUX MUXDIMFMT 3533 3532 3523 3522 3513 3512 000 Null 3531 Null 3521 Null 3511001 Null 3531 Null 3521 3502 3501 010 Null 3531 3504 3503 Null 3511 011Null 3531 3504 3503 3502 3501 100 reserved 101 reserved 110 3506 35053504 3503 3502 3501 111 3506 3505 3504 3503 3502 3501

FIG. 36 illustrates loop dimension selection circuit 3600 which is anexemplary embodiment selecting data from the stream template registerfor the various loop dimensions. Note that DIM0, the loop dimension ofloop0, is always ELEN_BYTES. As illustrated in FIGS. 28 and 30 to 34 thestream template register bits defining the loop dimension vary dependentupon the DIMFMT field. FIG. 36 illustrates bits 144 to 255 of the streamtemplate register. These bits are divided into 6 portions including:portion 3601, bits 144 to 159; portion 3602, bits 160 to 175; portion3603, bits 176 to 191; portion 3604, bits 192 to 207; portion 3605, bits208 to 223; and portion 3606, bits 224 to 255.

Concatenator 3611 forms a single 32-bit data word from portions 3602 and3603. Multiplexer 3612 selects either portion 3601, a null input orportion 3606 a DIM1 output. Multiplexer 3613 selects either portion 3602of the output of concatenator 3611 for the DIM2 output. Multiplexer 3614selects either portion 3604, a null input or portion 3606 for the DIM3output.

Concatenator 3621 forms a single 32-bit data word from portions 3604 and3605. Multiplexer 3622 selects either portion 3604 or the output ofconcatenator 3621 for the DIM4 output. Multiplexer 3623 selects either anull input, portion 3605 or portion 3606 for the DIM5 output.

DIMFMT DIM decoder 3607 receives the DIMFT bits from the stream templateregister and generates outputs controlling the selections ofmultiplexers 3612, 3613, 33614, 3622 and 353. Table 20 lists the controlof these multiplexers for the various codings of the DIMFMT field.

TABLE 20 DIM5 DIM4 DIM3 DIM2 DIM1 MUX MUX MUX MUX MUX DIMFMT 3623 36223614 3613 3612 000 Null 3621 Null 3611 Null 001 Null 3621 Null 3611 3606010 Null 3621 3606 3611 Null 011 Null 3621 3606 3611 3601 100 reserved101 reserved 110 3605 3604 3606 3611 3601 111 3606 3621 3603 3602 3601

FIG. 37 illustrates an example of adder control word circuit 3700 whichgenerates an adder control word for loop address generators to bedescribed below. The addressing mode fields AM0 2913, AM1 2914, AM22915, AM3 2916, AM4 2917 and AM5 2918 each control the addressing modeof a corresponding loop of the stream engine address. The addresscontrol word circuit 3700 is provided for each supported loop of thestreaming engine address. Adder 3701 forms the sum of CBK0, CBK1 and 1.The fields CBK0 and CBK1 are each 4-bit fields and are part of theEFLAGS field of the corresponding stream template register. The fieldsCBK0 and CBK1 are supplied to the operand inputs of adder 3701. Thequantity +1 is supplied to the carry-input of the least significant bitof adder 3701. This structure enables the three term addition withoutspecial adder hardware. The sum output of adder 3710 supplies one inputof multiplexer 3702. A second input of multiplexer 3702 is a null. Athird input of multiplexer 3701 is CBK0. Multiplexer 3702 is controlledby the AMx field for the corresponding loop. If AMx is 000, thenmultiplexer 3702 selects the null input. If AMx is 001, then multiplexer3702 selects the CBK0 input. If AMx is 010, then multiplexer 3702selects the sum CBK0+CBK1+1 output from adder 3701. The output ofmultiplexer 3702 is used as an index into adder control word look uptable 3703. The adder control words accessed from adder control wordlook up table 3703 are used to control a corresponding loop adder (seeFIG. 38) in manner similar to the SIMD control described above inconjunction with FIG. 18 and Table 3. The corresponding loop adderincludes carry break circuits as illustrated in FIG. 18 following bitscorresponding to the supported block sizes listed in Table 18. Addercontrol word look up table 3703 includes control words such as listed inTable 3 for the various block sizes. The selected number CBK0 orCBK0+CBK1+1 indexes the appropriate adder control word. If multiplexer3702 selects the null input, corresponding to linear addressing, thecorresponding adder control word is all 1's permitting adder carriesbetween all address bits.

FIG. 38 illustrates a partial schematic view of a streaming engine 2700address generator 3800. Address generator 3800 forms an address forfetching a next element in the defined stream of the correspondingstreaming engine. Start address register 3801 stores a start address ofthe data stream. As previously described, start address register 3801 ispreferably a scalar register in global scalar register file 211designated by the STROPEN instruction that opened the correspondingstream. As known in the art, this start address may be copied from thespecified scalar register and stored locally at the correspondingaddress generator 2711 OR 2721. A first loop of the stream employs Loop®count register 3811, adder 3812, multiplier 3813 and comparator 3814.Loop® count register 3811 stores the working copy of the iteration countof the first loop (Loop0). For each iteration of Loop® adder 3812, astriggered by the Next Address signal, adds 1 to the loop count, which isstored back in Loop® count register 3811. Multiplier 3813 multiplies thecurrent loop count and the quantity ELEM_BYTES. ELEM_BYTES is the sizeof each data element in the loop in bytes. Loop® traverses data elementsphysically contiguous in memory of the iteration step size isELEM_BYTES.

Comparator 3814 compares the count stored in Loop® count register 3811(after incrementing by adder 3812) with the value of ICNT0 2801 from thecorresponding stream template register 2800. As described above theloop0 count may be at portion 3001, portion 3101, portion 3201, portion3301 or portion 3401 depending upon the state of the DIMFMT field 2909.When the output of adder 3812 equals the value of ICNT0 2801 of thestream template register 2800, an iteration of Loop® is complete.Comparator 3814 generates an active Loop® End signal. Loop® countregister 3811 is reset to 0 and an iteration of the next higher loop, inthis case Loop1, is triggered.

Circuits for the higher loops (Loop1, Loop2, Loop3, Loop4, Loop5) aresimilar to that illustrated in FIG. 38. Each loop includes acorresponding working loop count register, adder, multiplier andcomparator. The adder of each loop is triggered by the loop end signalof the prior loop. The second input to each multiplier is thecorresponding dimension DIM1, DIM2, DIM3, DIM4 and DIM5 of thecorresponding stream template. The comparator of each loop compares theworking loop register count with the corresponding iteration valueICNT1, ICTN2, ICTN3, ICTN4 and ICTN5 of the corresponding streamtemplate register. A loop end signal generates an iteration of the nexthigher loop. A loop end signal from loop5 ends the stream.

FIG. 38 illustrates adder 3812 receiving an adder control word. Asdescribed above this adder control word is all 1's for linear addressingand has a 0 at the appropriate location for circular addressing. Thelocation of the 0 in the adder control word corresponding to thecircular block size of the circular addressing mode.

The central processing unit core 110 exposes the streaming engine toprograms through a small number of instructions and specializedregisters. A STROPEN instruction opens a stream. The STROPEN commandspecifies a stream number indicating opening stream 0 or stream 1. TheSTROPEN specifies a stream template register which stores the streamtemplate as described above. The arguments of the STROPEN instructionare listed in Table 21.

TABLE 21 Argument Description Stream Start Scaler register storingstream start Address Register address Steam Number Stream 0 or Stream 1Stream Template Vector register storing stream Register template data

The stream start address register is preferably a scalar register ingeneral scalar register file 211. The STROPEN instruction specifiesstream 0 or stream 1 by its opcode. The stream template register ispreferably a vector register in general vector register file 221. If thespecified stream is active the STROPEN instruction closes the priorstream and replaces the stream with the specified stream.

A STRCLOSE instruction closes a stream. The STRCLOSE command specifiesthe stream number of the stream to be closed.

A STRSAVE instruction captures sufficient state information of aspecified stream to restart that stream in the future. A STRRSTRinstruction restores a previously saved stream. A STRSAVE instructiondoes not save any of the data of the stream. A STRSAVE instruction savesonly metadata. The stream re-fetches data in response to a STRRSTRinstruction.

Streaming engine is in one of three states: Inactive; Active; or Frozen.When inactive the streaming engine does nothing. Any attempt to fetchdata from an inactive streaming engine is an error. Until the programopens a stream, the streaming engine is inactive. After the programconsumes all the elements in the stream or the program closes thestream, the streaming engine also becomes inactive. Programs which usestreams explicitly activate and inactivate the streaming engine. Theoperating environment manages streams across context-switch boundariesvia the streaming engine's implicit freeze behavior, coupled with itsown explicit save and restore actions.

Active streaming engines have a stream associated with them. Programscan fetch new stream elements from active streaming engines. Streamingengines remain active until one of the following. When the streamfetches the last element from the stream, it becomes inactive. Whenprogram explicitly closes the stream, it becomes inactive. When centralprocessing unit core 110 responds to an interrupt or exception, thestreaming engine freezes. Frozen streaming engines capture all the statenecessary to resume the stream where it was when the streaming enginefroze. The streaming engines freeze in response to interrupts andexceptions. This combines with special instructions to save and restorethe frozen stream context, so that operating environments can cleanlyswitch contexts. Frozen streams reactivate when central processing unitcore 110 returns to the interrupted context.

FIG. 39 is a partial schematic diagram 3900 illustrating the streaminput operand coding described above. FIG. 39 illustrates decoding src1field 1305 of one instruction of a corresponding src1 input offunctional unit 3920. These same circuits are duplicated for src2/cstfield 1304 and the src2 input of functional unit 3920. In addition,these circuits are duplicated for each instruction within an executepacket that can be dispatched simultaneously.

Instruction decoder 113 receives bits 13 to 17 comprising src1 field1305 of an instruction. The opcode field opcode field (bits 4 to 12 forall instructions and additionally bits 28 to 31 for unconditionalinstructions) unambiguously specifies a corresponding functional unit3920. In this embodiment functional unit 3920 could be L2 unit 241, S2unit 242, M2 unit 243, N2 unit 244 or C unit 245. The relevant part ofinstruction decoder 113 illustrated in FIG. 39 decodes src1 bit field1305. Sub-decoder 3911 determines whether src1 bit field 1305 is in therange from 00000 to 01111. If this is the case, sub-decoder 3911supplies a corresponding register number to global vector register file231. In this example this register field is the four least significantbits of src1 bit field 1305. Global vector register file 231 recallsdata stored in the register corresponding to this register number andsupplies this data to the src1 input of functional unit 3920. Thisdecoding is generally known in the art.

Sub-decoder 3912 determines whether src1 bit field 1305 is in the rangefrom 10000 to 10111. If this is the case, sub-decoder 3912 supplies acorresponding register number to the corresponding local vector registerfile. If the instruction is directed to L2 unit 241 or S2 unit 242, thecorresponding local vector register file is local vector register field232. If the instruction is directed to M2 unit 243, N2 unit 244 or Cunit 245, the corresponding local vector register file is local vectorregister field 233. In this example this register field is the threeleast significant bits of src1 bit field 1305. The corresponding localvector register file 232/233 recalls data stored in the registercorresponding to this register number and supplies this data to the src1input of functional unit 3920. This decoding is generally known in theart.

Sub-decoder 3913 determines whether src1 bit field 1305 is 11100. Ifthis is the case, sub-decoder 3913 supplies a stream 0 read signal tostreaming engine 2700. Streaming engine 2700 then supplies stream 0 datastored in holding register 2718 to the src1 input of functional unit3920.

Sub-decoder 3914 determines whether src1 bit field 1305 is 11101. Ifthis is the case, sub-decoder 3914 supplies a stream 0 read signal tostreaming engine 2700. Streaming engine 2700 then supplies stream 0 datastored in holding register 2718 to the src1 input of functional unit3920. Sub-decoder 3914 also supplies an advance signal to stream 0. Aspreviously described, streaming engine 2700 advances to store the nextsequential data elements of stream 0 in holding register 2718.

Sub-decoder 3915 determines whether src1 bit field 1305 is 11110. Ifthis is the case, sub-decoder 3915 supplies a stream 1 read signal tostreaming engine 2700. Streaming engine 2700 then supplies stream 1 datastored in holding register 2728 to the src1 input of functional unit3920.

Sub-decoder 3916 determines whether src1 bit field 1305 is 11111. Ifthis is the case, sub-decoder 3916 supplies a stream 1 read signal tostreaming engine 2700. Streaming engine 2700 then supplies stream 1 datastored in holding register 2728 to the src1 input of functional unit3920. Sub-decoder 3914 also supplies an advance signal to stream 1. Aspreviously described, streaming engine 2700 advances to store the nextsequential data elements of stream 1 in holding register 2728.

Similar circuits are used to select data supplied to scr2 input offunctional unit 3902 in response to the bit coding of src2/cst field1304. The src2 input of functional unit 3920 may be supplied with aconstant input in a manner described above.

The exact number of instruction bits devoted to operand specificationand the number of data registers and streams are design choices. Thoseskilled in the art would realize that other number selections thatdescribed in the application are feasible. In particular, thespecification of a single global vector register file and omission oflocal vector register files is feasible. This invention employs a bitcoding of an input operand selection field to designate a stream readand another bit coding to designate a stream read and advancing thestream.

While this specification contains many specifics, these should not beconstrued as limitations on the scope of what may be claimed, but ratheras descriptions of features that may be specific to particularembodiments. Certain features that are described in this specificationin the context of separate embodiments can also be implemented incombination in a single embodiment. Conversely, various features thatare described in the context of a single embodiment can also beimplemented in multiple embodiments separately or in any suitablesub-combination. Moreover, although features may be described above asacting in certain combinations and even initially claimed as such, oneor more features from a claimed combination can in some cases be excisedfrom the combination, and the claimed combination may be directed to asub-combination or variation of a sub-combination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults unless such order is recited in one or more claims. In certaincircumstances, multitasking and parallel processing may be advantageous.Moreover, the separation of various system components in the embodimentsdescribed above should not be understood as requiring such separation inall embodiments.

What is claimed is:
 1. A circuit device comprising: a memory interfaceconfigured to couple to a cache memory; a control register configured tostore: a count for an address loop; a mode value for the address loop; afirst block size value; and a second block size value; an addressgenerator coupled to the memory interface and to the control registerthat includes: an adder coupled to the control register to receive thefirst and second block size values, wherein the adder is configured toadd the first block size value and the second block size value toproduce a sum; and a multiplexer coupled to the adder to receive the sumand coupled to the control register to receive the first block sizevalue and the mode value, wherein the multiplexer is configured toselect between the sum and the first block size value based on the modevalue to produce a block size; wherein the address generator isconfigured to: generate a set of addresses in response to an instructionthat specifies the control register by iterating through a memory blockbased on the block size; and provide the set of addresses to the memoryinterface to retrieve a corresponding set of data from the cache memory.2. The circuit device of claim 1, wherein the address generator furtherincludes: a look-up table coupled to the multiplexer to receive theblock size and configured to provide a set of carry control signalsbased on the block size; and a loop adder coupled to the look-up tableto receive the set of carry control signals.
 3. The circuit device ofclaim 2, wherein the set of carry control signals are configured tocause an address to wrap when the block size is exceeded.
 4. The circuitdevice of claim 1, wherein the mode value is configured to selectbetween: a first circular addressing mode such that the block size isbased on the sum of the first block size value and the second block sizevalue; and a second circular addressing mode such that the block size isbased on the first block size value and is independent of the secondblock size value.
 5. The circuit device of claim 4, wherein the modevalue is configured to select between the first circular address mode,the second circular addressing mode, and a linear addressing mode. 6.The circuit device of claim 5, wherein the multiplexer is coupled toreceive a constant value and configured to provide the constant value inresponse to the mode value selecting the linear addressing mode.
 7. Thecircuit device of claim 1, wherein: the address loop is a first addressloop; the control register is configured to store a respective modevalue for each loop of a set of loops that includes the first addressloop; and the address generator includes a respective multiplexer foreach loop of the set of loops that is coupled to the adder andconfigured to select between the sum and the first block size valuebased on the respective mode value to produce a respective block sizefor the respective loop.
 8. The circuit device of claim 1 furthercomprising a stream head register coupled to the memory interface andconfigured to: receive the set of data from the memory interface; andprovide the set of data to a processor core as a data stream.
 9. Thecircuit device of claim 1, wherein the adder is configured to add aconstant to the first block size value and the second block size valueto produce the sum.
 10. The circuit device of claim 1, wherein: thecache memory is a level-two (L2) cache memory of a memory hierarchy, andthe memory interface is configured to retrieve the set of data from theL2 cache memory via a data path that does not include a level-one (L1)cache memory of the memory hierarchy.
 11. A circuit device comprising: aprocessing core; a memory; a data engine coupled between the processingcore and the memory and configured to receive an instruction from theprocessing core that specifies: a count for an address loop; a modevalue for the address loop; a first block size value; and a second blocksize value, wherein the data engine includes: a memory interface coupledto the memory; an address generator coupled to the memory interface,wherein the address generator includes: an adder coupled to receive thefirst and second block size values, wherein the adder is configured toadd the first block size value and the second block size value toproduce a sum; and a multiplexer coupled to the adder to receive the sumand coupled to receive the first block size value and the mode value,wherein the multiplexer is configured to select between the sum and thefirst block size based on the mode value to produce a block size;wherein the address generator is configured to: generate a set ofaddresses in response to the instruction by iterating through a memoryblock based on the block size; and provide the set of addresses to thememory interface to retrieve a corresponding set of data from thememory.
 12. The circuit device of claim 11, wherein the data enginefurther includes a stream head register coupled to the memory interfaceand to the processing core and configured to: receive the set of datafrom the memory interface; and provide the set of data to a processorcore as a data stream.
 13. The circuit device of claim 11, wherein theaddress generator further includes: a look-up table coupled to themultiplexer to receive the block size and configured to provide a set ofcarry control signals based on the block size; and a loop adder coupledto the look-up table to receive the set of carry control signals. 14.The circuit device of claim 13, wherein the set of carry control signalsare configured to cause an address to wrap when the block size isexceeded.
 15. The circuit device of claim 11, wherein the mode value isconfigured to select between: a first circular addressing mode such thatthe block size is based on the sum of the first block size value and thesecond block size value; and a second circular addressing mode such thatthe block size is based on the first block size value and is independentof the second block size value.
 16. The circuit device of claim 15,wherein the mode value is configured to select between the firstcircular address mode, the second circular addressing mode, and a linearaddressing mode.
 17. The circuit device of claim 16, wherein themultiplexer is coupled to receive a constant value and to provide theconstant value in response to the mode value selecting the linearaddressing mode.
 18. The circuit device of claim 11, wherein: theaddress loop is a first address loop; the instruction specifies arespective mode value for each loop of a set of loops that includes thefirst address loop; and the address generator includes a respectivemultiplexer for each loop of the set of loops that is coupled to theadder and configured to select between the sum and the first block sizebased on the respective mode value to produce a respective block sizefor the respective loop.
 19. The circuit device of claim 11, wherein theadder is configured to add a constant to the first block size value andthe second block size value to produce the sum.
 20. The circuit deviceof claim 11, wherein: the memory is a level-two (L2) cache memory of amemory hierarchy, and the memory interface is configured to retrieve theset of data from the L2 cache memory via a data path that does notinclude a level-one (L1) cache memory of the memory hierarchy.